The locality principle

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The locality principle

Full text

Html (25 KB), Pdf

Pdf (245 KB)

Source

Communications of the ACM archive
Volume 48 , Issue 7 (July 2005) table of contents
Designing for the mobile device

COLUMN: The profession of IT table of contents

Pages: 19 - 24

Year of Publication: 2005

ISSN:0001-0782

Author

Peter J. Denning

Naval Postgraduate School, Monterey, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 61, Downloads (12 Months): 423, Citation Count: 6

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1070838.1070856 What is a DOI?

ABSTRACT

Locality of reference is a fundamental principle of computing with many applications. Here is its story.

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 virtual storage computers. IBM Systems J. 5, 2 (1966), 78--101.
	2	Peter J. Denning, The working set model for program behavior, Communications of the ACM, v.11 n.5, p.323-333, May 1968 [doi>10.1145/363095.363141]
	3	Peter J. Denning, Virtual Memory, ACM Computing Surveys (CSUR), v.2 n.3, p.153-189, Sept. 1970 [doi>10.1145/356571.356573]
	4	Denning, P.J. Working sets past and present. IEEE Trans. on Software Engineering SE-6, 1 (Jan. 1980), 64--84.
	5	Kilburn, T., Edwards, D.B.G., Lanigan, M.J., Sumner, F.H. One-level storage system. IRE Transactions EC-11 (Apr. 1962), 223--235.
	6	A. Wayne Madison , Alan P. Batson, Characteristics of program localities, Communications of the ACM, v.19 n.5, p.285-294, May 1976 [doi>10.1145/360051.360227]
	7	Mattson, R.L., Gecsei, J., Slutz, D.R., and Traiger, I.L. Evaluation techniques for storage hierarchies. IBM Systems J. 9, 2 (1970), 78--117.
	8	Jeffrey R. Spirn, Program Behavior: Models and Measurements, Elsevier Science Inc., New York, NY, 1977
	9	Wilkes, M.V. Slave memories and dynamic storage allocation. IEEE Transactions on Computers EC-14 (Apr. 1965), 270--271.

CITED BY 6

	Dror G. Feitelson, Locality of sampling and diversity in parallel system workloads, Proceedings of the 21st annual international conference on Supercomputing, June 17-21, 2007, Seattle, Washington
	Hui Li , Michael Muskulus , Lex Wolters, Modeling correlated workloads by combining model based clustering and a localized sampling algorithm, Proceedings of the 21st annual international conference on Supercomputing, June 17-21, 2007, Seattle, Washington
	Panagiotis Louridas , Diomidis Spinellis , Vasileios Vlachos, Power laws in software, ACM Transactions on Software Engineering and Methodology (TOSEM), v.18 n.1, p.1-26, September 2008
	Wilbur Peng , William Krueger , Alexander Grushin , Patrick Carlos , Vikram Manikonda , Michel Santos, Graph-based methods for the analysis of large-scale multiagent systems, Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems, May 10-15, 2009, Budapest, Hungary
	Yu Du , Sandeep K. S. Gupta , Georgios Varsamopoulos, Improving on-demand data access efficiency in MANETs with cooperative caching, Ad Hoc Networks, v.7 n.3, p.579-598, May, 2009
	João Barreto , João Garcia , Luís Veiga , Paulo Ferreira, Data-aware connectivity in mobile replicated systems, Proceedings of the Eighth ACM International Workshop on Data Engineering for Wireless and Mobile Access, June 29-29, 2009, Providence, Rhode Island