By Topic

Using method lookup caches and register windowing to speed up dynamically-bound object-oriented applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ghose, K. ; Dept. of Comput. Sci., State Univ. of New York, Binghamton, NY, USA ; Desai, K.R. ; Kogge, P.M.

The implementation of dynamically bound object oriented programming languages require the ability to quickly bind a logical reference to a method and to quickly allocate a context for the invoked method. In this paper we examine how a method lookup cache (MLC) and a register windowing mechanism can speed up method binding and context allocation. We also show how the MLC can be incorporated into a contemporary pipelined datapath. A detailed register level simulation of the proposed scheme, driven by a set of fairly intensive object-oriented applications, show that a relatively small method lookup cache with only 64 or 128 entries reduces the average execution time of the applications by about 50%. With register windowing and the MLC, execution time reduces by 76% to 87% with respect to the base machine

Published in:

EUROMICRO 96. Beyond 2000: Hardware and Software Design Strategies., Proceedings of the 22nd EUROMICRO Conference

Date of Conference:

2-5 Sep 1996