Skip to main content


eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item:
Title: Efficient Generation of Memory Reference Strings Based on the LRU Stack Model of Program Behaviour
Authors: Babaoglu,Ozalp
Keywords: computer science
technical report
Issue Date: Oct-1981
Publisher: Cornell University
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.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
81-475.pdf1.49 MBAdobe PDFView/Open
81-475.ps410.44 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us