Optimizing multi-method dispatch using compressed dispatch tables

19Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

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. © 1994, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Amiel, E., Gruber, O., & Simon, E. (1994). Optimizing multi-method dispatch using compressed dispatch tables. ACM SIGPLAN Notices, 29(10), 244–258. https://doi.org/10.1145/191081.191117

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free