ACM Home Page
Please provide us with feedback. Feedback
Characteristics of program localities
Full text PdfPdf (969 KB)
Source
Communications of the ACM archive
Volume 19 ,  Issue 5  (May 1976) table of contents
Pages: 285 - 294  
Year of Publication: 1976
ISSN:0001-0782
Authors
A. Wayne Madison  Univ. of Virginia, Charlottesville, VA
Alan P. Batson  Univ. of Virginia, Charlottesville, VA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 23,   Citation Count: 25
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/360051.360227
What is a DOI?

ABSTRACT

The term “locality” has been used to denote that subset of a program's segments which are referenced during a particular phase of its execution. A program's behavior can be characterized in terms of its residence in localities of various sizes and lifetimes, and the transitions between these localities. In this paper the concept of a locality is made more explicit through a formal definition of what constitutes a phase of localized reference behavior, and by a corresponding mechanism for the detection of localities in actual reference strings. This definition provides for the existence of a hierarchy of localities at any given time, and the reasonableness of the definition is supported by examples taken from actual programs. Empirical data from a sample of production Algol 60 programs is used to display distributions of locality sizes and lifetimes, and these results are discussed in terms of their implications for the modeling of program behavior and memory management in virtual memory 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), 78-101.
 
2
Denning, P.J. On modeling program behavior. AFIPS Conf. Proc., Vol. 40, 1972 SJCC, AFIPS Press, Montvale, N.J., 1972, pp. 937-945.
 
3
Spirn, J.R., and Denning, P.J. Experiments with program locality. AFIPS Conf. Proc., Vol. 41, 1972 FJCC, AFIPS Press, Montvale, N.J., 1972, pp. 611-621.
 
4
Hatfield, D.J., and Gerald, J. Program restructuring for virtual memory. IBM Systems J. 10, (1971), 168-192.
5
 
6
Denning, P.J. A Note on a definition of program locality. Memorandum PD 75.5, Purdue U., available from the author.
7
 
8
Brundage, R.E., Ph.D. Th., U. of Virginia, 1974.
9
 
10
Brundage, R.E., and Batson, A.P. The use of associative memory in symbolically segmented virtual memory systems. To appear in Revue Francaise d'Automatique, Informatique et Recherche Operationelle (serie bleue), 1976.
 
11
Knuth, D.E. An empirical study of FORTRAN programs. Software-Practice and Experience 1 (1971), 105-133.

CITED BY  26

Collaborative Colleagues:
A. Wayne Madison: colleagues
Alan P. Batson: colleagues