Can I read Optimizing Method Search with Lookup Caches and Incremental Coloring on EtoBox?

Optimizing Method Search with Lookup Caches and Incremental Coloring by Pascal André; Jean-Claude Royer is a scholarly article available to read on EtoBox.

What is Optimizing Method Search with Lookup Caches and Incremental Coloring about?

An efficient mechanism for method lookup is csscntial in any reasonable implementation of a clussbased object-oriented language. One tcchniquc, static caches, provide constant time lookup, but consumes cxcessive memory. To alleviate the memory consumption problem many systems USC a coloring schcmc that allows cache rows to be shared and thus reduces the ovcrall cache size. This technique is easily implcmcntcd I'OI stongly typed languages such as C++ and Eiffcl, but not for languages such as CLOS or Smalltalk. This papct provides a solution to this latter problem: that of coloring for static caches in dynamically typed objcct-oricnted languages. Our solution is to use an incrcmcntal coloring algorithm to avoid the memory consumption problems of the naive approach. l-Introduction Object-oriented programming is an attractive programming sub-paradigm for many reasons, not the lcast of which are: polymorphism, encapsulation, mcssagc Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given th

Author

Pascal André; Jean-Claude Royer

Publisher

ACM

Published

1992

Language

EN