Cart (Loading....) | Create Account
Close category search window

Prefetching in supercomputer instruction caches

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

2 Author(s)
Smith, J.E. ; Cray Research Inc., Chippewa Falls, WI, USA ; Hsu, W.-C.

Prefetching methods for instruction caches in supercomputers are studied via trace-driven simulation. The two primary methods studied are fall-through prefetch for sequential line accesses and target prefetch for nonsequential ones. As measured by miss rate, both methods are shown to improve performance significantly. When combined in a hybrid algorithm their performance improvement is cumulative. A prefetch efficiency measure that reflects the amount of memory fetch delay that is successfully hidden by prefetching is defined. The better prefetch methods (in terms of miss rate) also have very high efficiencies, hiding approximately 90% of the miss delay for prefetched lines. The results obtained also show that the top-performing prefetch caches produce less memory traffic than the top-performing nonprefetch caches

Published in:

Supercomputing '92., Proceedings

Date of Conference:

16-20 Nov 1992

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.