A fast method dispatcher for compiled languages with multiple inheritance

Dixon, Rebecca R.; McKee, Terry A.; Vaughan, M.J.; Schweizer, P.

doi:10.1145/74877.74900

Cited by 68 publications

(20 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the number of valid class-method pairs is far smaller, at most 5 %: it is the total size of method tables in SST, Σ C M C . Two techniques for compacting that table have been proposed: row displacement proposed by and method coloring proposed and studied by Dixon et al [1989], Pugh and Weddel [1990], André and Royer [1992] and Ducournau [1991;. The latter technique will be detailed further.…”

Section: Compilation Techniquesmentioning

confidence: 99%

“…Method coloring has been proposed by Dixon et al [1989], under the name of selector coloring. One of the first experimentations, by André and Royer [1992], concluded to large coloring computation time and the technique was considered as uneffective ever since.…”

Section: Coloring Heuristicsmentioning

confidence: 99%

“…methods) verifies the invariant: therefore, an optimization is needed. The first proposition, by Dixon et al [1989], André and Royer [1992], was to minimize the color number, which is an NP-hard graph coloring problem [Garey and Johnson 1979]. A first improvement, proposed by Pugh and Weddel [1990] and Ducournau [1991;, consists in minimizing the total size of method (resp.…”

Section: Coloring Heuristicsmentioning

confidence: 99%

“…In any case, heuristics are needed and some experiments, by Pugh and Weddel [1990] and Ducournau [1997;2002a], show their efficiency and that improvements are effective. Dixon et al [1989], André and Royer [1992] applied first coloring to methods, whereas Pugh and Weddel [1990], and Ducournau [1991] applied it to attributes, and Vitek et al [1997] and Ducournau [2002a] to classes, as a generalization of the SST technique of Cohen [1991]:…”

Section: Coloring Heuristicsmentioning

confidence: 99%

See 3 more Smart Citations

Implementing statically typed object-oriented programming languages

Ducournau

2011

ACM Comput. Surv.

View full text Add to dashboard Cite

In statically typed object-oriented languages, message sending, or late binding, is implemented with tables often called virtual functions tables (VFT). Those tables reduce method calls to function calls, with a small fixed number of extra indirections. The overhead is more or less important, whether inheritance and subtyping are single or multiple.In this paper, we survey the various implementation schemes available in separate compilation, in the three cases of single inheritance, multiple inheritance, and single inheritance but multiple subtyping, e.g. Java. Many works have been done recently in the framework of global compilation, mostly for dynamically typed languages but also applied to the Eiffel language in the Small Eiffel compiler. We examine how global compilation can improve the implementation and propose to use global techniques-coloring and type analysis-in a separate compilation framework.

show abstract

Section: Compilation Techniquesmentioning

confidence: 99%

Section: Coloring Heuristicsmentioning

confidence: 99%

Section: Coloring Heuristicsmentioning

confidence: 99%

Section: Coloring Heuristicsmentioning

confidence: 99%

See 2 more Smart Citations

Implementing statically typed object-oriented programming languages

Ducournau

2011

ACM Comput. Surv.

View full text Add to dashboard Cite

show abstract

“…Selector coloring [D+89,AR92] is a compromise between VTBL and STI. SC is similar to STI, but instead of using the selector to index into the table, SC uses the selector's color.…”

Section: Selector Coloring (Sc)mentioning

confidence: 99%

Message Dispatch on Pipelined Processors

Driesen

Hölzle

Vítek

Object-Oriented Programming

View full text Add to dashboard Cite

Abstract. Object-oriented systems must implement message dispatch efficiently in order not to penalize the object-oriented programming style. We characterize the performance of most previously published dispatch techniques for both statically-and dynamically-typed languages with both single and multiple inheritance. Hardware organization (in particular, branch latency and superscalar instruction issue) significantly impacts dispatch performance. For example, inline caching may outperform C++-style "vtables" on deeply pipelined processors even though it executes more instructions per dispatch. We also show that adding support for dynamic typing or multiple inheritance does not significantly impact dispatch speed for most techniques, especially on superscalar machines. Instruction space overhead (calling sequences) can exceed the space cost of data structures (dispatch tables), so that minimal table size may not imply minimal run-time space usage.

show abstract

Multiple‐Dispatching Based on Automata

Chen¹,

Turau²

1995

Theory & Prac Object Systems

View full text Add to dashboard Cite

We present a novel technique for multiple-dispatching. In object-oriented programming languages, multipledispatching provides increased expressive power over single-dispatching by gUiding method lookup using the values of all arguments instead of the receiver only. However, the efficient implementation for multipledispatching is still critical with regard to its success as a standard. There have been several time-efficient dispatching techniques proposed, but they are very space consuming. In this article, we transform multipledispatching Into a lookup automaton problem. Analysis and experiments show that our approach is spaceefficient while providing the same time-efficiency as the previous known techniques. Moreover, we present a technique to further minimize the space-complexity of lookup automata.

show abstract

A fast method dispatcher for compiled languages with multiple inheritance

Cited by 68 publications

References 4 publications

Implementing statically typed object-oriented programming languages

Implementing statically typed object-oriented programming languages

Message Dispatch on Pipelined Processors

Multiple‐Dispatching Based on Automata

Contact Info

Product

Resources

About