NDLI: Efficient multiple and predicated dispatching

Content Provider	ACM Digital Library
Author	Chen, Weimin Chambers, Craig
Abstract	The speed of message dispatching is an important issue in the overall performance of object-oriented programs. We have developed an algorithm for constructing efficient dispatch functions that combines novel algorithms for efficient single dispatching, multiple dispatching, and predicate dispatching. Our algorithm first reduces methods written in the general predicate dispatching model (which generalizes single dispatching, multiple dispatching, predicate classes and classifiers, and pattern-matching) into ones written using a simpler multimethod dispatching model. Our algorithm then computes a strategy for implementing multiple dispatching in terms of sequences of single dispatches, representing the strategy as a lookup DAG. Finally, our algorithm computes an implementation strategy separately for each of the single dispatches, producing for each dispatch a dispatch tree, which is a binary decision tree blending class identity tests, class range tests, and table lookups. Our algorithm exploits any available static information (from type declarations or class analysis) to prune unreachable paths from the lookup DAG, and uses any available dynamic profile information to minimize the expected time to search the dispatch trees. We measure the effectiveness of our dispatching algorithms on a collection of large Cecil programs, compiled by the Vortex optimizing compiler, showing improvements of up to 30% over already heavily optimized baseline versions.
Starting Page	238
Ending Page	255
Page Count	18
File Format	PDF
ISSN	03621340 15581160
DOI	10.1145/320385.320407
Journal	ACM SIGPLAN Notices (SIGP)
Volume Number	34
Issue Number	10
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1983-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching

PolyD:a flexible dispatching framework

Efficient handling of multiple inheritance hierarchies

Evaluation of predicated array data-flow analysis for automatic parallelization

Space and time-efficient memory layout for multiple inheritance

Efficient parallel recursion

Efficient data breakpoints

A sparse algorithm for predicated global value numbering

Multiple tense computer programming

Efficient multiple and predicated dispatching

Similar Documents

Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching

PolyD:a flexible dispatching framework

Efficient handling of multiple inheritance hierarchies

Evaluation of predicated array data-flow analysis for automatic parallelization

Space and time-efficient memory layout for multiple inheritance

Efficient parallel recursion

Efficient data breakpoints

A sparse algorithm for predicated global value numbering

Multiple tense computer programming

Efficient multiple and predicated dispatching