HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Fast Algorithms for Compressed Multi-Method Dispatch Tables Generation

Eric Amiel Eric Dujardin 1 Eric Simon 1
1 RODIN - Database Systems
Inria Paris-Rocquencourt
Abstract : The efficiency of dynamic dispatch is a major impediment to the adoption of multi-methods in object languages. In this paper, we propose a simple multi-method dispatch scheme based on compressed dispatch tables. This scheme is applicable to most existing object languages, and guarantees that dynamic dispatch is performed in constant time, a major requirement for some languages and applications. We provide efficient algorithms to build the compressed dispatch tables, and demonstrate the effectiveness of our scheme by real measurements performed on a large object-oriented application. Finally, we relate our scheme to existing techniques, including a detailed comparison with a recent proposal.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 1:36:11 PM
Last modification on : Thursday, February 3, 2022 - 11:16:53 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:56:05 PM


  • HAL Id : inria-00073721, version 1



Eric Amiel, Eric Dujardin, Eric Simon. Fast Algorithms for Compressed Multi-Method Dispatch Tables Generation. [Research Report] RR-2977, INRIA. 1996. ⟨inria-00073721⟩



Record views


Files downloads