The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A study of replacement algorithms for a virtual-storage computer
Abstract
One of the basic limitations of a digital computer is the size of its available memory.1In most cases, it is neither feasible nor economical for a user to insist that every problem program fit into memory. The number of words of information in a program often exceeds the number of cells (i.e., word locations) in memory. The only way to solve this problem is to assign more than one program word to a cell. Since a cell can hold only one word at a time, extra words assigned to the cell must be held in external storage. Conventionally, overlay techniques are employed to exchange memory words and external-storage words whenever needed; this, of course, places an additional planning and coding burden on the programmer. For several reasons, it would be advantageous to rid the programmer of this function by providing him with a “virtual” memory larger than his program. An approach that permits him to use a sufficiently large address range can accomplish this objective, assuming that means are provided for automatic execution of the memory-overlay functions.
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
Kilburn, 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
Cited by
The SimpleScalar tool set, version 2.0
Burger, D., & Austin, T. M. (1997) · ACM SIGARCH Computer Architecture News · doi:10.1145/268806.268810 · Cited by 3,048
Amortized efficiency of list update and paging rules
Sleator, D. D., & Tarjan, R. E. (1985) · Communications of the ACM · doi:10.1145/2786.2793 · Cited by 2,123
Smith, A. J. (1982) · ACM Computing Surveys · doi:10.1145/356887.356892 · Cited by 1,722
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
The working set model for program behavior
Denning, P. J. (1983) · Communications of the ACM · doi:10.1145/357980.357997 · Cited by 845
Frigo, M., Leiserson, C. E., Prokop, H., & Ramachandran, S. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814600 · Cited by 803
The working set model for program behavior
Denning, P. J. (1968) · Communications of the ACM · doi:10.1145/363095.363141 · Cited by 662
High performance cache replacement using re-reference interval prediction (RRIP)
Jaleel, A., Theobald, K. B., Steely, S. C., & Emer, J. (2010) · Proceedings of the 37th annual international symposium on Computer architecture · doi:10.1145/1815961.1815971 · Cited by 641
Karlin, A. R., Manasse, M. S., Rudolph, L., & Sleator, D. D. (1988) · Algorithmica · doi:10.1007/bf01762111 · Cited by 631
Evaluating associativity in CPU caches
Hill, M. D., & Smith, A. J. (1989) · IEEE Transactions on Computers · doi:10.1109/12.40842 · Cited by 606
Lee, D., Choi, J., Kim, J.-H., Noh, S. H., Min, S. L., Cho, Y., & Kim, C. S. (2001) · IEEE Transactions on Computers · doi:10.1109/tc.2001.970573 · Cited by 590
A User-Oriented Software Reliability Model
Cheung, R. C. (1980) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1980.234477 · Cited by 529
Atchison, W. F., Conte, S. D., Hamblen, J. W., Hull, T. E., Keenan, T. A., Kehl, W. B., McCluskey, E. J., Navarro, S. O., Rheinboldt, W. C., Schweppe, E. J., et al. (1968) · Communications of the ACM · doi:10.1145/362929.362976 · Cited by 468
Denning, P. J. (1980) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1980.230464 · Cited by 396
Memory bandwidth limitations of future microprocessors
Burger, D., Goodman, J. R., & Kägi, A. (1996) · Proceedings of the 23rd annual international symposium on Computer architecture · doi:10.1145/232973.232983 · Cited by 392
CFLRU: a replacement algorithm for flash memory
Park, S.-Y., Jung, D., Kang, J.-U., Kim, J.-S., & Lee, J. (2006) · Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems · doi:10.1145/1176760.1176789 · Cited by 385
Linear scan register allocation
Poletto, M., & Sarkar, V. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/330249.330250 · Cited by 357
Cooperative Caching for Chip Multiprocessors
Chang, J., & Sohi, G. S. (2006) · ACM SIGARCH Computer Architecture News · doi:10.1145/1150019.1136509 · Cited by 355
A Comprehensive Study of the Past, Present, and Future of Data Deduplication
Xia, W., Jiang, H., Feng, D., Douglis, F., Shilane, P., Hua, Y., Fu, M., Zhang, Y., & Zhou, Y. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2016.2571298 · Cited by 318
F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption
Samardzic, N., Feldmann, A., Krastev, A., Devadas, S., Dreslinski, R., Peikert, C., & Sanchez, D. (2021) · MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/3466752.3480070 · Cited by 294
Cache-enabled small cell networks: modeling and tradeoffs
Baştuǧ, E., Bennis, M., Kountouris, M., & Debbah, M. (2015) · EURASIP Journal on Wireless Communications and Networking · doi:10.1186/s13638-015-0250-4 · Cited by 292
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
Denning, P. J. (2005) · Communications of the ACM · doi:10.1145/1070838.1070856 · Cited by 277
High performance cache replacement using re-reference interval prediction (RRIP)
Jaleel, A., Theobald, K. B., Steely, S. C., & Emer, J. (2010) · ACM SIGARCH Computer Architecture News · doi:10.1145/1816038.1815971 · Cited by 264
A survey of sparse matrix research
Duff, I. S. (1977) · Proceedings of the IEEE · doi:10.1109/proc.1977.10514 · Cited by 262
The Role of Caching in Future Communication Systems and Networks
Paschos, G. S., Iosifidis, G., Tao, M., Towsley, D., & Caire, G. (2018) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2018.2844939 · Cited by 259
Albers, S. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0436-0 · Cited by 259
Outperforming LRU with an adaptive replacement cache algorithm
Megiddo, N., & Modha, D. S. (2004) · Computer · doi:10.1109/mc.2004.1297303 · Cited by 243
A strongly competitive randomized paging algorithm
McGeoch, L. A., & Sleator, D. D. (1991) · Algorithmica · doi:10.1007/bf01759073 · Cited by 238
Mining query logs: turning search usage data into knowledge
Silvestri, F. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000013 · Cited by 194
“The idea behind the ideal (and theoretically optimal) Belady’s OPT cache policy: “in case of miss and cache full, replace the page that will be accessed farthest in the future” [38].”
BackgroundCompetitive Caching with Machine Learned Advice
Lykouris, T., & Vassilvitskii, S. (2021) · Journal of the ACM · doi:10.1145/3447579 · Cited by 172
Batch query processing for web search engines
Ding, S., Attenberg, J., Baeza-Yates, R., & Suel, T. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935858 · Cited by 22
AgentRM: An OS-Inspired Resource Manager for LLM Agent Systems
She, J. (2026) · arXiv · doi:10.48550/arxiv.2603.13110
“Weapproximate Belady’s MIN algorithm [17] by using semantic similarity to predict future access likelihood.”
Tiwari, S., Chugh, T., Rickert, N., Peter, S., Mahajan, R., & Shen, H. (2026) · arXiv · doi:10.48550/arxiv.2606.16824
ThunderAgent: A Simple, Fast and Program-Aware Agentic Inference System
Kang, H., Li, Z., Xu, W., Yang, X., Chen, Y., Wang, J., Chen, B., Krishna, T., Xu, C., & Arora, S. (2026) · arXiv · doi:10.48550/arxiv.2602.13692
Metadata
- Authors
- Belady, L. A.
- Venue
- IBM Systems Journal
- Publisher
- IBM
- Published
- 1966
- Volume
- 5
- Issue
- 2
- Pages
- 78-101
- ISSN
- 0018-8670 (ISSN-L)
- OpenAlex
- W1987225815
- Cited by
- 1,659
- References
- 1
- FWCI
- 10.80
- Type
- journal article
- Language
- en
- Open access
- closed
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.