By Topic

Dynamic CPU cache management under the loop model

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
$33 $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)
C. Jaouhar ; Dept. of Comput. Sci. & Eng., Florida Atlantic Univ., Boca Raton, FL, USA ; I. Mahgoub ; R. Hewett

Concerns cache designs using replacement strategies to provide the high performance required by fast CPUs. We propose a new replacement technique that uses some heuristic to detect loop structures in the reference patterns. Initially, the proposed technique uses the least recently used (LRU) strategy. Once a loop has been detected, all the references, which would result in poor performance if they were to be cached, will be dynamically excluded from being stored in the cache. The LRU strategy will resume as soon as the end of the loop has been detected. We have also developed a simulation program to compare the performance of this scheme to that of other related ones so as to demonstrate its effectiveness. The results show our scheme outperforms the others when the system references are loop dominated

Published in:

Southcon/95. Conference Record

Date of Conference:

7-9 Mar 1995