Efficient Dispatch of Multimethods in Constant Time Using Dispatch Trees - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 1996

Efficient Dispatch of Multimethods in Constant Time Using Dispatch Trees

(1)
1
Eric Dujardin
  • Function : Author

Abstract

Optimizing method dispatch is a central issue in object-oriented language implementation. Besides overall efficiency, a major requirement for some languages and applications is constant-time performance. In systems with multi-methods, these requirements are still harder to meet. The compressed dispatch table scheme, presented in (Amiel et al, OOPSLA 94), was the first to meet them. Its compression algorithm is based on the definition of "pole types". In this report, we investigate another structure, namely the dispatch tree, showing that it can also meet those requirements. We show that pole types can be used to compress dispatch trees, and we describe some optimizations of compressed dispatch trees. The resulting run-time structures are yet smaller than compressed dispatch tables.
Fichier principal
Vignette du fichier
RR-2892.pdf (350.82 Ko) Télécharger le fichier

Dates and versions

inria-00073798 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073798 , version 1

Cite

Eric Dujardin. Efficient Dispatch of Multimethods in Constant Time Using Dispatch Trees. [Research Report] RR-2892, INRIA. 1996. ⟨inria-00073798⟩
123 View
384 Download

Share

Gmail Facebook Twitter LinkedIn More