S. Milton and Heinz W. Schmidt. Dynamic Dispatch in Object-Oriented Languages. Technical Report TR-CS-94-02, The Australian National University, Canberra, January 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....is used often before it is evicted from the cache. This section discusses two kinds of caching: global caching (one large cache per system) and inline caching (one one entry cache per call site) 1 This is done in SELF [16] Indirect instance variable access is used in Eiffel and Sather [102]. Figure 8. Memory layout of objects in the case of multiple inheritance. pa a1 A B C . pb b1 . pc a1 . c1 . b1 . adjusted pb A C B The offset of instance variable b1 is different in instances of B versus instances of C. 18 3.2.1 Global lookup caches (LC) First generation ....

....to run Smalltalk. In [40] we analyze algorithmic issues of a number of dispatch techniques for dynamically typed languages, but without taking processor architecture into account. Hlzle et al. 70] compare IC and PIC for the SELF system running on a scalar SPARC processor. Milton and Schmidt [102] compare the performance of VTBL like techniques for Sather. None of these studies takes superscalar processors into account. Calder et al. 14] discuss branch misprediction penalties for indirect function calls in C . Their measurements of several C programs indicate that inline caching might ....

S. Milton and Heinz W. Schmidt. Dynamic Dispatch in Object-Oriented Languages. Technical Report TR-CS-94-02, The Australian National University, Canberra, January 1994.

....the differences from Eiffel have been presented in [6, 7, 8, 9] The type system is presented in depth in [13] Moreover, ICSI technical papers report on other specific issues, see [2, 4, 11, 13] 1 Sather has been analyzed from an external point of view. Comments and comparisons can be found in [1, 3, 12]. 1.3 Related Work: Sather K Although we know a lot about Sather K, which is being developed in Karlsruhe, Germany, it is not yet available online. Future versions of this Technical Report, which can be accessed from anonymous ftp will have some more details. 1.4 Planned Changes to this ....

Scott Milton and Heinz W. Schmidt. Dynamic dispatch in object-oriented languages. Technical Report TR-CS-94-02, CSIRO -- Division of Information Technology, Canberra, Australia, January 1992.

....at run time. Thus, static techniques only use information that can be statically derived from the program s source text. Dynamic techniques may 1 Alternatively, a system could duplicate code (e.g. as in Self [CUL89] or access instance variables indirectly (as is done in Eiffel and Sather [MS94]) a 0 A c 1 B e 4 C f 2 a 3 f 5 g 6 D b 7 d 8 E A a B acf C e E bd D fg Figure 2. Class hierarchy with corresponding dispatch tables 4 Message dispatch on modern computer architectures precompute some information at compile or link time, but they dynamically update ....

....run Smalltalk. Driesen [Dri93b] analyzes algorithmic issues of a number of dispatch techniques for dynamically typed languages, but without taking processor architecture into account. Hlzle et al. [HCU91] compare IC and PIC for the Self system running on a scalar SPARC processor. Milton and Schmidt [MS94] compare the performance of VTBL like techniques for Sather. None of these studies takes superscalar processors into account. Calder et al. CG94] discuss branch misprediction penalties for indirect function calls in C . Their measurements of several C programs indicate that inline caching ....

S. Milton and Heinz W. Schmidt. Dynamic Dispatch in Object-Oriented Languages. Technical Report TR-CS-94-02, The Australian National University, Canberra, January 1994.

....and separate compilation. The message expression object selector ( is converted to a messenger call messageSend (object, selector, thereby avoiding recompilation of code. Only system global data structures need to be updated. Overviews of existing algorithms can be found in Schmidt [17], Vitek [22, 12] Driesen [6] and Cox [3] we include these references for completeness. Before presenting dispatching algorithms for dynamically typed languages, we present dynamic binding as implemented in C to illustrate the subtle difference between static and dynamic typing and how it ....

.... a 1 a 1 a 1 a 1 a 1 a 1 a 1 a 1 a 1 b 1 b 1 b 1 b 6 b 1 b 1 b 1 b 1 b 1 c 9 c 7 c 7 c 2 c 2 c 2 c 2 c 2 c 1 d 2 d 2 d 4 d 4 d 2 d 7 d 7 d 9 e 3 f 3 g 5 i 6 h 7 h 8 h 7 i 7 i 7 i 7 Figure 2: The VTBL layout for the hierarchy example. Milton and Schmidt [17] present alternative dispatching mechanisms for statically typed languages and discuss them in the context of the language Sather. Eiffel [16] and Oberon2 [18] also use variants of the VTBL data structure for message dispatching. 2.2 Inheritance Search An intuitive implementation of the ....

Scott Milton and Heinz W. Schmidt. Dynamic dispatch in object-oriented languages. Technical Report TR-CS-94-02, Computer science department, The Australian National University, Canberra, 1994.

....potential 4 . Note that type maps in our sense are intended to be high performance; we exclude the many low performance dispatch table methods and methods that always make out of line subroutine calls. Detailed information has been published on the type maps used in C [Str94, p. 266] EIFFEL[MS94, page 7] SATHER 0.6[MS94] and HASKELL[Jon94, section 7.5.1] Languages that have made some use of type maps have not been comprehensive about doing so. Probably this is because type maps are introduced only to implement certain features of the languages. However, we believe that the most ....

....type maps in our sense are intended to be high performance; we exclude the many low performance dispatch table methods and methods that always make out of line subroutine calls. Detailed information has been published on the type maps used in C [Str94, p. 266] EIFFEL[MS94, page 7] SATHER 0. 6[MS94] and HASKELL[Jon94, section 7.5.1] Languages that have made some use of type maps have not been comprehensive about doing so. Probably this is because type maps are introduced only to implement certain features of the languages. However, we believe that the most successful programming languages ....

[Article contains additional citation context not shown here]

Scott Milton and Heinz W. Schmidt. Dynamic dispatch in object-oriented languages. Technical Report TR-CS-94-02, Australian National University, Canberra, January 1994.

....space overhead and the closed vs. open world assumption (see section 6) For space reasons, we consider only the main variant of each technique. 1 Alternatively, a system could duplicate code (e.g. as in SELF [CUL89] or access instance variables indirectly (as is done in Eiffel and Sather [MS94]) Figure 1. The memory layout of objects of class A, B, and C. Note that the offset of instance variable b1 is different in instances of B versus instances of C. pb pc C B A b1 . a1 . c1 . b1 . pa a1 . A B C adjusted pb A further simplification on the hardware side is that we do ....

....Smalltalk. Driesen [Dri93b] analyzes algorithmic issues of a number of dispatch techniques for dynamically typed languages, but without taking processor architecture into account. H lzle et al. HCU91] compare IC and PIC for the SELF system running on a scalar SPARC processor. Milton and Schmidt [MS94] compare the performance of VTBL like techniques for Sather. None of these studies takes superscalar processors into account. Calder et al. CG94] discuss branch misprediction penalties for indirect function calls in C . Their measurements of several C programs indicate that inline caching ....

S. Milton and Heinz W. Schmidt. Dynamic Dispatch in Object-Oriented Languages. Technical Report TR-CS-94-02, The Australian National University, Canberra, January 1994.

....parallel solutions and are rapidly entereing the workstation and high end desktop market as cheap mainstream entry point to parallel computing. To utilize the performance potential of such chips, application programmers must be architecture aware, as highly optimizing compilers are not available [Sit93, MiS94]. 1 1 Vendors do not seriously invest in highly optimizing compilers for these architectures, as the second generation of these chips will be on the market before compilers for the first generation would have time to mature. Parallel Program Transformation 7 Sajeev and Schmidt sequential ....

Milton, S. and Schmidt, H.W., Dynamic Dispatch in Object-Oriented Languages, to appear, .

No context found.

S. Milton and Heinz W. Schmidt. Dynamic Dispatch in Object-Oriented Languages. Technical Report TR-CS-94-02, The Australian National University, Canberra, January 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC