ACM Home Page
Please provide us with feedback. Feedback
Measurements of major locality phases in symbolic reference strings
Full text PdfPdf (712 KB)
Source Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation table of contents
Cambridge, Massachusetts, United States
Pages: 75 - 84  
Year of Publication: 1976
Authors
Sponsors
IFIP WG 7.3 : IFIP WG 7.3
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 15,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800200.806184
What is a DOI?

ABSTRACT

Previous studies have shown that a program's behavior can be characterized as a sequence of transitions between phases of execution during which some subset of the program's segments is referenced. The nature of the phases (sometimes called localities or regimes), and the characteristics of the transitions between neighboring phases, will determine the performance of the program on a virtual memory system. We here investigate methods for identifying those “major” phases in programs which correspond to intervals of distinctive referencing behavior. Experimental measurements on symbolic reference strings generated by production Algol-60 programs are used to determine the properties of these phases and the transitions between them. The experimental results are discussed in terms of current models for program behavior and also with regard to their implications for memory management systems.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Belady, L. A., A Study of Replacement Algorithms for a Virtual Storage Computer. IBM Systems J. 5 (1966) pp. 78-101.
 
2
Denning, P. J., On Modeling Program Behavior. Proc. AFIPS SJCC (1972) pp. 937-945.
 
3
Spirn, J. R. and P. J. Denning, Experiments with Program Locality. Proc. AFIPS FJCC (1972) pp. 611-621.
 
4
Freiberger, W. F., U. Grenander, and P. D. Sampson, Patterns in Program References. IBM J. of R. and D. 19, 3 (1975) pp. 230-243.
 
5
Hatfield, D. J. and J. Gerald, Program Restructuring for Virtual Memory. IBM Systems J. 10 (1971) pp. 168-192.
6
7
8
 
9
Brundage, R. E., Ph.D. thesis, University of Virginia, 1974.
 
10
Prieve, B. G. and R. S. Fabry, VMIN - an Optimal Variable Space Replacement Policy. Presented at Proc. 5th ACM Symposium on Operating Systems Principles, Austin, Texas, November 1975. To appear in CACM.

CITED BY  10

Collaborative Colleagues:
A. P. Batson: colleagues
A. W. Madison: colleagues