Multi-method Dispatch Using Multiple Row Displacement
Candy Pang,Wade Holst,Yuri Leontiev,Duane Szafron +3 more
- 14 Jun 1999
- pp 304-328
TL;DR: This paper presents the new MRD algorithm and provides experimental results that compare it with implementations of existing techniques: compressed n-dimensional tables, look-up automata and single-receiver projection.
read more
Abstract: Multiple Row Displacement (MRD) is a new dispatch technique for multi-method languages. It is based on compressing an n-dimensional table using an extension of the single-receiver row displacement mechanism. This paper presents the new algorithm and provides experimental results that compare it with implementations of existing techniques: compressed n-dimensional tables, look-up automata and single-receiver projection. MRD uses comparable space to the other techniques, but has faster dispatch performance.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Efficient multiple and predicated dispatching
Craig Chambers,Weimin Chen +1 more
- 01 Oct 1999
TL;DR: An algorithm for constructing efficient dispatch functions that combines novel algorithms for efficient single dispatching, multiple dispatches, and predicate dispatching is developed, showing improvements of up to 30% over already heavily optimized baseline versions.
81
Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching
Yoav Zibin,Joseph Gil +1 more
- 04 Nov 2002
TL;DR: This paper shows how to extend one such solution to the multiple-inheritance~(MI) setting, with an increase to the space requirement by a small factor of κ, which can be thought of as a metric of the complexity of the topology of the inheritance hierarchy.
33
•Proceedings Article
Multi-dispatch in the Java virtual machine: design and implementation
Christopher Dutchyn,Paul Lu,Duane Szafron,Steven Bromling,Wade Holst +4 more
- 29 Jan 2001
TL;DR: The general-purpose technique provides smaller dispatch latency than programmer-written double-dispatch code with equivalent functionality and isolates the performance penalty and semantic changes of multimethod dispatch to the program sections which use it.
Java Multi-Method Framework
Rémi Forax,Étienne Duris,Gilles Roussel +2 more
- 20 Nov 2000
TL;DR: This paper proposes a pure Java framework that provides multi-methods, without extending the base Java language nor modifying its semantics but intensively using the reflection mechanism of the language.
Efficient message dispatch in object-oriented systems
Mayur Naik,Rajeev Kumar +1 more
TL;DR: This paper presents a time and space efficient implementation of the switch that employs the table- based technique when an array lookup outperforms a binary search and the tree-based technique when abinary search outperforms an array Lookup.
24
References
•Book
Object-oriented programming ; an evolutionary approach
Brad Cox,Andrew J. Novobilski +1 more
- 01 Jan 1986
TL;DR: The author describes the development of an object-oriented C language compiler, and how it can be put to work.
1K
Near optimal hierarchical encoding of types
Andreas Krall,Jan Vitek,R. Nigel Horspool +2 more
- 09 Jun 1997
TL;DR: A new algorithm based on graph coloring which computes a near optimal hierarchical encoding of type hierarchies is presented which improves significantly on previous results - it is faster, simpler and generates smaller bit vectors.
Tigukat: a uniform behavioral objectbase management system
M. Tamer Özsu,Randal J. Peters,Duane Szafron,Boman Irani,Anna Lipka,Adriana Muñoz +5 more
- 01 Jul 1995
TL;DR: The TIGUKAT objectbase management system, which is under development at the Laboratory for Database Systems Research at the University of Alberta, has a novel object model, whose identifying characteristics include a purely behavioral semantics and a uniform approach to objects.
Optimizing multi-method dispatch using compressed dispatch tables
Eric Amiel,Olivier Gruber,Eric J. Simon +2 more
- 01 Oct 1994
TL;DR: This paper proposes an algorithm to compress the dispatch tables of multi-methods by analyzing their signatures and shows how to reduce the size of dispatch tables with techniques such as coloring.
53
Selector table indexing & sparse arrays
Karel Driesen
- 01 Oct 1993
TL;DR: A sparse array implementation is presented, which reduces the memory consumption by an order of magnitude, while performing retrieval in constant time, and is shown to be complementary to dynamic caching techniques such as inline caching.
Related Papers (5)
Eric Amiel,Olivier Gruber,Eric J. Simon +2 more
- 01 Oct 1994
Weimin Chen,Volker Turau,Wolfgang Klas +2 more
- 04 Jul 1994
Gregor Kiczales,Luis O. Rodriguez +1 more
- 01 May 1990
Margaret A. Ellis,Bjarne Stroustrup +1 more
- 01 Jan 1990