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

Program modelling via inter-reference gaps and 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

2 Author(s)
Phalke, V. ; Dept. of Comput. Sci., Rutgers Univ., NJ, USA ; Gopinath, B.

Locality of reference in program behavior has been studied and modelled extensively because of its application to CPU, cache and virtual memory design, code optimization, multiprogramming etc. In this paper we propose a scheme based on Markov chains for modelling the time interval between successive references to the same address in a program execution. Using this technique and trace driven simulations, it is shown that memory references are predictable and repetitive. This is used to improve miss ratios of memory replacement algorithms. Using trace driven simulations over a wide range of traces we get improvements up to 35% over the least recently used (LRU) replacement algorithm

Published in:

Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1995. MASCOTS '95., Proceedings of the Third International Workshop on

Date of Conference:

18-20 Jan 1995

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.