In the study of generative models based on working set size characterizations, working set size strings are used as inputs. The properties that an integer string should possess in order to guarantee the termination of reference string generation algorithms are discussed in this paper. A hierarchical view with respect to one window and two window working set size characterization is presented. Working set size strings extracted from real traces may contain flat-faults which can cause difficulties in a class of reference string generation algorithms. The role and properties of flat-faults in the working set size strings are presented along with their limiting behavior under independent reference assumption. An upper bound of the flat-fault rate is also obtained in this paper.
Title
The Properties and Limiting Behavior of Working Set Size Strings and Flat-faults
Published
Computer Science Division, University of California at Berkeley, Berkeley, California, November 1982
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
CSD-82-108
Type
Text
Extent
12 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).
