Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Computer Science
  4. Computer Science Technical Reports
  5. Efficient Generation of Memory Reference Strings Based on the LRU Stack Model of Program Behaviour

Efficient Generation of Memory Reference Strings Based on the LRU Stack Model of Program Behaviour

File(s)
81-475.pdf (1.45 MB)
81-475.ps (410.44 KB)
Permanent Link(s)
https://hdl.handle.net/1813/6315
Collections
Computer Science Technical Reports
Author
Babaoglu,Ozalp
Abstract

We consider the problem of generating memory reference strings that are to be used instead of real program address traces with the generator based on the Least-Recently-Used Stack Model (LRUSM) of program behaviour. A method to transform the stack distance probability mass function that drives the generator is proposed which results in memory reference strings that are a fraction of theoriginal string length while preserving most of its essential performance characteristics. The reduced string can be processed in much the same way as the original string for virtual memory studies that deal with memory sizes greater than $k$, the parameter of the transformation.

Date Issued
1981-10
Publisher
Cornell University
Keywords
computer science
•
technical report
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR81-475
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance