The locality principle
Open accessThe DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Abstract
Locality of reference is a fundamental principle of computing with many applications. Here is its story.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Linked: The New Science of Networks
Barabási, A.-L., & Aldana-Gonzalez, M. (2003) · Physics Today · doi:10.1063/1.1570778 · Cited by 2,724
THE ALOHA SYSTEM: another alternative for computer communications
Abramson, N. (1970) · Proceedings of the November 17-19, 1970, fall joint computer conference on - AFIPS '70 (Fall) · doi:10.1145/1478462.1478502 · Cited by 2,029
A study of replacement algorithms for a virtual-storage computer
Belady, L. A. (1966) · IBM Systems Journal · doi:10.1147/sj.52.0078 · Cited by 1,659
Ethernet: distributed packet switching for local computer networks
Metcalfe, R. M., & Boggs, D. R. (1983) · Communications of the ACM · doi:10.1145/357980.358015 · Cited by 1,509
Self-similarity of complex networks
Song, C., Havlin, S., & Makse, H. A. (2005) · Nature · doi:10.1038/nature03248 · Cited by 1,495
Evaluation techniques for storage hierarchies
Mattson, R. L., Gecsei, J., Slutz, D. R., & Traiger, I. L. (1970) · IBM Systems Journal · doi:10.1147/sj.92.0078 · Cited by 1,302
Watts, D. J. (2004) · Annual Review of Sociology · doi:10.1146/annurev.soc.30.020404.104342 · Cited by 1,163
The working set model for program behavior
Denning, P. J. (1983) · Communications of the ACM · doi:10.1145/357980.357997 · Cited by 845
Self-citationProgramming semantics for multiprogrammed computations
Dennis, J. B., & Van Horn, E. C. (1983) · Communications of the ACM · doi:10.1145/357980.357993 · Cited by 676
The working set model for program behavior
Denning, P. J. (1968) · Communications of the ACM · doi:10.1145/363095.363141 · Cited by 662
Self-citationCarrier, B. D. (2005) · Cited by 577
Denning, P. J. (1970) · ACM Computing Surveys · doi:10.1145/356571.356573 · Cited by 407
Self-citationDenning, P. J. (1980) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1980.230464 · Cited by 396
Self-citationFabry, R. S. (1974) · Communications of the ACM · doi:10.1145/361011.361070 · Cited by 355
Principles of Optimal Page Replacement
Aho, A. V., Denning, P. J., & Ullman, J. D. (1971) · Journal of the ACM · doi:10.1145/321623.321632 · Cited by 289
Self-citationKilburn, T., Edwards, D. B. G., Lanigan, M. J., & Sumner, F. H. (1962) · IEEE Transactions on Electronic Computers · doi:10.1109/tec.1962.5219356 · Cited by 256
Harrison, M. C., & Wilkes, M. V. (1970) · Mathematics of Computation · doi:10.2307/2004522 · Cited by 158
Program Behavior: Models and Measurements
Spirn, J. R. (1977) · Elsevier eBooks · Cited by 125
Farmer, D., & Venema, W. (2004) · Cited by 121
Characteristics of program localities
Madison, A. W., & Batson, A. P. (1976) · Communications of the ACM · doi:10.1145/360051.360227 · Cited by 119
WSCLOCK—a simple and effective algorithm for virtual memory management
Carr, R. W., & Hennessy, J. L. (1981) · ACM SIGOPS Operating Systems Review · doi:10.1145/1067627.806596 · Cited by 100
Denning, P. J., Kahn, K. C., Leroudier, J., Potier, D., & Suri, R. (1976) · Acta Informatica · doi:10.1007/bf00265771 · Cited by 71
Self-citationAdaptive optimization of a time-sharing system's performance
Badel, M., Erol Gelenbe, A., Leroudier, J., & Potier, D. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9861 · Cited by 41
Denning, P. J. (2004) · Communications of the ACM · doi:10.1145/1029496.1029510 · Cited by 28
Self-citation
Research works printed but not linked: 1
- 10.1109/PGEC.1965.264263 · DOI
Cited by
Cooperative Caching for Chip Multiprocessors
Chang, J., & Sohi, G. S. (2006) · ACM SIGARCH Computer Architecture News · doi:10.1145/1150019.1136509 · Cited by 355
Küçük, D., & Can, F. (2021) · ACM Computing Surveys · doi:10.1145/3369026 · Cited by 300
A Survey on the Memory Mechanism of Large Language Model based Agents
Zhang, Z., Bo, X., Ma, C., Li, R., Chen, X., Dai, Q., Zhu, J., Dong, Z., & Wen, J.-R. (2024) · arXiv · doi:10.48550/arxiv.2404.13501 · Cited by 149
KSwSVR: A New Load Forecasting Method for Efficient Resources Provisioning in Cloud
Hu, R., Jiang, J., Liu, G., & Wang, L. (2013) · 2013 IEEE International Conference on Services Computing · doi:10.1109/scc.2013.67 · Cited by 22
Cooperative Scheduling and Hierarchical Memory Model for Multi-Agent Systems
Zou, H., Li, R., Sun, T., Wang, F., Li, T., & Liu, K. (2024) · 2024 IEEE International Symposium on Product Compliance Engineering - Asia (ISPCE-ASIA) · doi:10.1109/ispce-asia64773.2024.10756271 · Cited by 4
Metadata
- Authors
- Denning, P. J.
- Venue
- Communications of the ACM
- Published
- 2005-07
- Volume
- 48
- Issue
- 7
- Pages
- 19-24
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2015853171
- Cited by
- 277
- References
- 24
- FWCI
- 16.56
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.