inria-00073721, version 1
Fast Algorithms for Compressed Multi-Method Dispatch Tables Generation
Eric AmielEric Dujardin a, 1Eric Simon 1
N° RR-2977 (1996)
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.
- a – Université Paris Sud - Paris XI
- 1: RODIN (INRIA Rocquencourt)
- INRIA
- Domain : Computer Science/Other
- Keywords : MULTI-METHODS / LATE BINDING / RUN-TIME DISPATCH / DISPATCH TABLES / POLE TYPES / OPTIMIZATION
- Internal note : RR-2977
- Comment : Projet RODIN
- inria-00073721, version 1
- http://hal.inria.fr/inria-00073721
- oai:hal.inria.fr:inria-00073721
- From: Rapport De Recherche Inria
- Submitted on: Wednesday, 24 May 2006 13:36:11
- Updated on: Wednesday, 6 June 2007 11:09:34






Associated documents

Export