ACM Home Page
Please provide us with feedback. Feedback
Optimizing multi-method dispatch using compressed dispatch tables
Full text PdfPdf (1.83 MB)
Source Conference on Object Oriented Programming Systems Languages and Applications archive
Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications table of contents
Portland, Oregon, United States
Pages: 244 - 258  
Year of Publication: 1994
ISBN:0-89791-688-3
Also published in ...
Authors
Eric Amiel  INRIA Rocquencourt, Projet RODIN, BP 105, 78153 Le Chesnay Cedex, France
Olivier Gruber  INRIA Rocquencourt, Projet RODIN, BP 105, 78153 Le Chesnay Cedex, France
Eric Simon  INRIA Rocquencourt, Projet RODIN, BP 105, 78153 Le Chesnay Cedex, France
Sponsor
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 23,   Citation Count: 11
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/191080.191117
What is a DOI?

ABSTRACT

Optimizing method dispatch is a central issue in object-oriented language implementation. The dispatch table scheme, used for example by C++, is the only implementation of method dispatch that offers constant time performance. This property is the main asset of dispatch tables and a major requirement for some languages. However, the major drawback of dispatch tables is the space they require. Reducing the size of dispatch tables has been studied in the case of mono-methods with techniques such as coloring. In the case of multi-methods, dispatch tables are practically unusable as they grow as a power of the number of arguments. In this paper, we propose an algorithm to compress the dispatch tables of multi-methods by analyzing their signatures.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

ADL91
AR92
BDG+88
BKK+86
 
Cha92
 
CU90
Craig Chambers and David Ungar. Iterative type analysis and extended message splitting. In Proc. SIGPLAN 90, volume 23, pages 27-34, 1990.
CU91
CUL89
 
Deu83
L. Peter Deutsch. Smalltalk-80: Bits of History and Works of Advice, chapter The Dorado Smalltalk-80 Implementation: Hardware Architecture. Addison Wesley, 1983.
DMPM89
DS84
 
CR83
 
HCU91
Ing86
 
KR90
Gregor Kiczales and Luis Rodrigrez. Efficient method dispatch in PCL. In Proc. ACM POPL, 1990.
 
Mey92
 
MHH91
REJZ88
Ros88
 
SO91
Heinz W. Schmidt and Stephen Omohundro. Clos. Eiffel, and Sather: A comparison. Technical Report TR-91-047, International Computer Science Institute, Berkeley, CA, 1991.
 
Str86
 
Ung86
 
UP83
David Ungar and David Patterson. Smalltalk-80: Bits of History and Words of Advice, chapter Berkeley Smalltalk: Who Knows Where the Time Goes? Addison Wesley, 1983.
 
UP87
 
USCH92

CITED BY  11

Collaborative Colleagues:
Eric Amiel: colleagues
Olivier Gruber: colleagues
Eric Simon: colleagues