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.
Title
Working Set Size Strings
Published
1982-11-01
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
CSD-82-109
Type
Text
Extent
9 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
