Domenico Ferrari

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-82-109
November 1982

http://www2.eecs.berkeley.edu/Pubs/TechRpts/1982/CSD-82-109.pdf

The properties of working set size strings, i.e., of the strings of integers representing the sequences of values taken by the working set sizes of programs, are investigated. Particular attention is given to the conditions to be satisfied by a given string of integers, by a pair of such strings, or by an n-tuple of strings for the existence of a page reference string whose working set size strings coincide with the given ones for given values of the window size. These conditions are useful in generating artificial reference strings exhibiting a given memory demand dynamics.

BibTeX citation:

@techreport{Ferrari:CSD-82-109,
    Author = {Ferrari, Domenico},
    Title = {Working Set Size Strings},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1982},
    Month = {Nov},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1982/6356.html},
    Number = {UCB/CSD-82-109},
    Abstract = {The properties of working set size strings, i.e., of the strings of integers representing the sequences of values taken by the working set sizes of programs, are investigated.  Particular attention is given to the conditions to be satisfied by a given string of integers, by a pair of such strings, or by an n-tuple of strings for the existence of a page reference string whose working set size strings coincide with the given ones for given values of the window size.  These conditions are useful in generating artificial reference strings exhibiting a given memory demand dynamics.}
}

EndNote citation:

%0 Report
%A Ferrari, Domenico
%T Working Set Size Strings
%I EECS Department, University of California, Berkeley
%D 1982
%@ UCB/CSD-82-109
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1982/6356.html
%F Ferrari:CSD-82-109