One-Level Storage System
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
After a brief survey of the basic Atlas machine, the paper describes an automatic system which in principle can be applied to any combination of two storage systems so that the combination can be regarded by the machine user as a single level. The actual system described relates to a fast core store-drum combination. The effect of the system on instruction times is illustrated, and the tape transfer system is also introduced since it fits basically in through the same hardware. The scheme incorporates a ``learning'' program, a technique which can be of greater importance in future computers.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Swapping [23,42,55], recomputation [7,24] and their combination [40] have been utilized to reduce the peak memory of training.”
From Efficient Memory Management for Large Language Model Serving with PagedAttention (2023) · cites this paper as [23]
Citations
Cites
The Manchester University Atlas Operating System Part I: Internal Organization
Kilburn, T. (1961) · The Computer Journal · doi:10.1093/comjnl/4.3.222 · Cited by 45
Self-citationA parallel arithmetic unit using a saturated-transistor fast-carry circuit
Kilburn, T., Edwards, D. B. G., & Aspinall, D. (1960) · Proceedings of the IEE Part B Electronic and Communication Engineering · doi:10.1049/pi-b-2.1960.0171 · Cited by 41
Self-citationA digital computer store with very short read time
Kilburn, T., & Grimsdale, R. L. (1960) · Proceedings of the IEE Part B Electronic and Communication Engineering · doi:10.1049/pi-b-2.1960.0170 · Cited by 21
Self-citationThe Manchester University Mark II digital-computing machine
Kilburn, T., Edwards, D. B. G., & Thomas, G. (1956) · The proceedings of the Institution of Electrical Engineers. Part B, Radio and electronic engineering, including communication engineering · doi:10.1049/pi-b-1.1956.0052 · Cited by 9
Self-citationMercury: a high-speed digital computer
Lonsdale, K., & Warburton, E. T. (1956) · The proceedings of the Institution of Electrical Engineers. Part B, Radio and electronic engineering, including communication engineering · doi:10.1049/pi-b-1.1956.0039 · Cited by 7
Ferrite-core memory systems with rapid cycle times
Edwards, D. B. G., Lanigan, M. J., & Kilburn, T. (1960) · Proceedings of the IEE Part B Electronic and Communication Engineering · doi:10.1049/pi-b-2.1960.0172 · Cited by 6
Self-citationSome Techniques for dealing with Two-Level Storage
Brooker, R. A. (1960) · The Computer Journal · doi:10.1093/comjnl/2.4.189 · Cited by 1
Research works printed but not linked: 1
- papian, 1957, High-speed computer stores 2.5 megabits, Electronics, 30
Cited by
Efficient Memory Management for Large Language Model Serving with PagedAttention
Kwon, W., Li, Z., Zhuang, S., Sheng, Y., Zheng, L., Yu, C. H., Gonzalez, J., Zhang, H., & Stoica, I. (2023) · Proceedings of the 29th Symposium on Operating Systems Principles · doi:10.1145/3600006.3613165 · Cited by 1,817
“To address the memory challenges in §3, we introduce PagedAttention, an attention algorithm inspired by the classic idea of paging [25] in operating systems.”
BackgroundMethodEfficient Memory Management for Large Language Model Serving with PagedAttention
Kwon, W., Li, Z., Zhuang, S., Sheng, Y., Zheng, L., Yu, C. H., Gonzalez, J. E., Zhang, H., & Stoica, I. (2023) · arXiv · doi:10.48550/arxiv.2309.06180 · Cited by 1,802
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
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
Computer Architecture, Fifth Edition: A Quantitative Approach
Hennessy, J. L., & Patterson, D. A. (2011) · Morgan Kaufmann Publishers Inc. eBooks · Cited by 880
The working set model for program behavior
Denning, P. J. (1983) · Communications of the ACM · doi:10.1145/357980.357997 · Cited by 845
Memory Systems: Cache, DRAM, Disk
Jacob, B., Ng, S. W., & Wang, D. (2007) · Cited by 752
The working set model for program behavior
Denning, P. J. (1968) · Communications of the ACM · doi:10.1145/363095.363141 · Cited by 662
Denning, P. J. (1996) · ACM Computing Surveys · doi:10.1145/234313.234403 · Cited by 573
Generation Scavenging: A non-disruptive high performance storage reclamation algorithm
Ungar, D. (1984) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/390010.808261 · Cited by 484
Denning, P. J. (1980) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1980.230464 · Cited by 396
Introduction and overview of the multics system
Corbató, F. J., & Vyssotsky, V. A. (1965) · AFIPS Fall Joint Computer Conference (FJCC) · doi:10.1145/1463891.1463912 · Cited by 386
The Origin of the VM/370 Time-Sharing System
Creasy, R. J. (1981) · IBM Journal of Research and Development · doi:10.1147/rd.255.0483 · Cited by 366
Virtualizing Transactional Memory
Rajwar, R., Herlihy, M. P., & Lai, K. K. (2005) · ACM SIGARCH Computer Architecture News · doi:10.1145/1080695.1070011 · Cited by 343
Virtualizing Transactional Memory
Rajwar, R., Herlihy, M. P., & Lai, K. K. (2005) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca.2005.54 · Cited by 305
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
Advancing Transformer Architecture in Long-Context Large Language Models: A Comprehensive SurveyPreprint
Huang, Y.-P., Xu, J., Lai, J., Jiang, Z., Chen, T., Li, Z., Yao, Y., Ma, X., Yang, L., Chen, H., et al. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2311.12351 · Cited by 213
Virtual memory, processes, and sharing in MULTICS
Daley, R. C., & Dennis, J. B. (1968) · Communications of the ACM · doi:10.1145/363095.363139 · Cited by 191
Segmentation and the Design of Multiprogrammed Computer Systems
Dennis, J. B. (1965) · Journal of the ACM · doi:10.1145/321296.321310 · Cited by 188
Slave Memories and Dynamic Storage Allocation
Wilkes, M. V. (1965) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1965.264263 · Cited by 158
Electronic Computers: A Historical Survey
Rosen, S. (1969) · ACM Computing Surveys · doi:10.1145/356540.356543 · Cited by 156
Glift: Generic, efficient, random-access GPU data structures
Lefohn, A. E., Sengupta, S., Kniss, J. M., Strzodka, R., & Owens, J. D. (2006) · ACM Transactions on Graphics · doi:10.1145/1122501.1122505 · Cited by 151
Third Generation Computer Systems
Denning, P. J. (1971) · ACM Computing Surveys · doi:10.1145/356593.356595 · Cited by 142
Adaptive page replacement based on memory reference behavior
Glass, G. W., & Cao, P. (1997) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/258612.258681 · Cited by 137
Strongly Competitive Algorithms for Paging with Locality of Reference
Irani, S., Karlin, A. R., & Phillips, S. (1996) · SIAM Journal on Computing · doi:10.1137/s0097539792236353 · Cited by 128
A Modern Primer on Processing in MemoryPreprint
Mutlu, O., Ghose, S., Gómez-Luna, J., Ausavarungnirun, R., Sadrosadati, M., & Junior, G. F. D. O. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.03112 · Cited by 116
Content-Addressable and Associative Memory Systems a Survey
Hanlon, A. G. (1966) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1966.264358 · Cited by 109
Organization of the Motorola 88110 superscalar RISC microprocessor
Diefendorff, K., & Allen, M. (1992) · IEEE Micro · doi:10.1109/40.127582 · Cited by 105
Dynamic storage allocation systems
Randell, B., & Kuehner, C. J. (1968) · Communications of the ACM · doi:10.1145/363095.363138 · Cited by 100
Competitive paging with locality of reference
Borodin, A., Raghavan, P., Irani, S., & Schieber, B. (1991) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/103418.103422 · Cited by 96
Saltzer, J. H. (1978) · Lecture notes in computer science · doi:10.1007/3-540-08755-9_4 · Cited by 94
Architecture of the IBM system/370
Case, R. P., & Padegs, A. (1978) · Communications of the ACM · doi:10.1145/359327.359337 · Cited by 94
Virtual storage and virtual machine concepts
Parmelee, R. P., Peterson, T. I., Tillman, C. C., & Hatfield, D. J. (1972) · IBM Systems Journal · doi:10.1147/sj.112.0099 · Cited by 94
Instruction Cache Replacement Policies and Organizations
Smith, & Goodman (1985) · IEEE Transactions on Computers · doi:10.1109/tc.1985.1676566 · Cited by 85
Virtual memory: issues of implementation
Jacob, B., & Mudge, T. (1998) · Computer · doi:10.1109/2.683005 · Cited by 84
Brown, A. L. (1989) · St Andrews Research Repository (St Andrews Research Repository) · Cited by 84
Enabling the Adoption of Processing-in-Memory: Challenges, Mechanisms, Future Research DirectionsPreprint
Ghose, S., Hsieh, K., Boroumand, A., Ausavarungnirun, R., & Mutlu, O. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.00320 · Cited by 81
The KSR 1: bridging the gap between shared memory and MPPs
Frank, S., Burkhardt, H., & Rothnie, J. B. (2002) · IEEE Computer Society International Conference (COMPCON Spring) · doi:10.1109/cmpcon.1993.289682 · Cited by 75
Architecture of a Quantum Multicomputer Optimized for Shor's Factoring AlgorithmPreprint
Meter, R. D. V. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0607065 · Cited by 75
An environment for research in microprogramming and emulation
Rosin, R. F., Frieder, G., & Eckhouse, R. H. (1972) · Communications of the ACM · doi:10.1145/361532.361550 · Cited by 69
A Case for Efficient Hardware/Software Cooperative Management of Storage and Memory
Meza, J., Luo, Y., Khan, S., Zhao, J., Xie, Y., & Mutlu, O. (2013) · KiltHub Repository · doi:10.1184/r1/6468164 · Cited by 68
Bridging the Information Gap in Storage Protocol Stacks
Denehy, T. E., Arpaci-Dusseau, A. C., & Arpaci-Dusseau, R. H. (2002) · USENIX Annual Technical Conference · Cited by 67
The Improvement of Program Behavior
Ferrari, D. (1976) · Computer · doi:10.1109/c-m.1976.218440 · Cited by 65
Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization
van de Belt, J., Ahmadi, H., & Doyle, L. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2704899 · Cited by 64
Randomized and multipointer paging with locality of reference
Fiat, A., & Karlin, A. R. (1995) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/225058.225280 · Cited by 62
Persistent memory: a storage architecture for object-oriented database systems
Thatte, S. M. (1986) · Cited by 60
Distributed Paging for General Networks
Awerbuch, B., Bartal, Y., & Fiat, A. (1998) · Journal of Algorithms · doi:10.1006/jagm.1998.0924 · Cited by 60
Perspective—Historical Roots of theA Behavioral Theory of the FirmModel at GSIA
Augier, M., & Prietula, M. J. (2007) · Organization Science · doi:10.1287/orsc.1070.0276 · Cited by 59
A study of instruction cache organizations and replacement policies
Smith, J. E., & Goodman, J. R. (1983) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/800046.801648 · Cited by 57
Schröter, J. (2004) · transcript Verlag eBooks · doi:10.14361/9783839401767 · Cited by 56
Page overlays: an enhanced virtual memory framework to enable fine-grained memory management
Seshadri, V., Pekhimenko, G. G., Ruwase, O., Mutlu, O., Gibbons, P. B., Kozuch, M. A., Mowry, T. C., & Chilimbi, T. M. (2015) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/2749469.2750379 · Cited by 54
Determination of Cache's Capacity and its Matching Storage Hierarchy
Chow, C. K. (1976) · IEEE Transactions on Computers · doi:10.1109/tc.1976.5009230 · Cited by 54
The working set model for program behavior
Denning, P. J. (1967) · doi:10.1145/800001.811670 · Cited by 54
A Modified Working Set Paging Algorithm
Smith (1976) · IEEE Transactions on Computers · doi:10.1109/tc.1976.1674715 · Cited by 53
SYMBOL: a large experimental system exploring major hardware replacement of software
Smith, W. R., Rice, R., Chesley, G. D., Laliotis, T. A., Lundstrom, S. F., Calhoun, M. A., Gerould, L. D., & Cook, T. G. (1971) · AFIPS Spring Joint Computer Conference (SJCC) · doi:10.1145/1478786.1478869 · Cited by 52
Systems Architecture for Quantum Random Access Memory
Xu, S., Hann, C. T., Foxman, B., Girvin, S. M., & Ding, Y. (2023) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3613424.3614270 · Cited by 51
The Manchester Mark I and atlas: a historical perspective
Lavington, S. (1978) · Communications of the ACM · doi:10.1145/359327.359331 · Cited by 50
A study of the effect of user program optimization in a paging system
Comeau, L. W. (1967) · doi:10.1145/800001.811667 · Cited by 47
Performance Evaluation of Computing Systems with Memory Hierarchies
Anacker, W., & Wang, C. P. (1967) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1967.264722 · Cited by 47
RESOURCE ALLOCATION IN MULTIPROCESS COMPUTER SYSTEMS
Denning, P. J. (1968) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 47
Stability in a Persistent Store Based on a Large Virtual Memory
Rosenberg, J., Henskens, F. A., Brown, F., Morrison, R., & Munro, D. S. (1990) · Workshops in computing · doi:10.1007/978-1-4471-3178-6_16 · Cited by 45
Bibliography on paging and related topics
Smith, A. J. (1978) · ACM SIGOPS Operating Systems Review · doi:10.1145/775406.775409 · Cited by 45
The Processing-in-Memory Paradigm: Mechanisms to Enable Adoption
Ghose, S., Hsieh, K., Boroumand, A., Ausavarungnirun, R., & Mutlu, O. (2018) · Springer eBooks · doi:10.1007/978-3-319-90385-9_5 · Cited by 43
Meade, R. M. (1970) · AFIPS Fall Joint Computer Conference (FJCC) · doi:10.1145/1478462.1478468 · Cited by 39
The Virtual Block Interface: A Flexible Alternative to the Conventional Virtual Memory Framework
Hajinazar, N., Patel, P., Patel, M., Kanellopoulos, K., Ghose, S., Ausavarungnirun, R., Junior, G. F. D. O., Appavoo, J., Seshadri, V., & Mutlu, O. (2020) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca45697.2020.00089 · Cited by 38
A Historical Overview of Computer Architecture
Smith, R. E. (1988) · IEEE Annals of the History of Computing · doi:10.1109/mahc.1988.10039 · Cited by 38
Schröter, J. (2004) · doi:10.5555/9783839401767 · Cited by 37
Virtual memory, processes, and sharing in Multics
Daley, R. C., & Dennis, J. B. (1967) · doi:10.1145/800001.811668 · Cited by 37
Two-Level Replacement Decisions in Paging Stores
Babaoğlu, Ö., & Ferrari (1983) · IEEE Transactions on Computers · doi:10.1109/tc.1983.1676176 · Cited by 37
Evaluation of multilevel memories
Mattson, R. L. (1971) · IEEE Transactions on Magnetics · doi:10.1109/tmag.1971.1067237 · Cited by 37
Address mapping and the control of access in an interactive computer
Evans, D. C., & Leclerc, J. Y. (1967) · AFIPS Spring Joint Computer Conference (SJCC) · doi:10.1145/1465482.1465486 · Cited by 37
Kuehner, C. J., & Randell, B. (1968) · AFIPS Fall Joint Computer Conference (FJCC) · doi:10.1145/1476706.1476720 · Cited by 37
Generalized multiprocessing and multiprogramming systems
Critcklow, A. J. (1963) · AFIPS Fall Joint Computer Conference (FJCC) · doi:10.1145/1463822.1463836 · Cited by 37
Circuit technology in a large computer system
Kinniment, D. J., & Edwards, D. B. G. (1973) · Radio and Electronic Engineer · doi:10.1049/ree.1973.0068 · Cited by 35
Self-citationGüvenilir, F. A., & Patt, Y. N. (2020) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca45697.2020.00078 · Cited by 34
Making computers keep secrets.
Rotenberg, L. J. (1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 34
Demand paging through utilization of working sets onr the MANIAC II
Morris, J. B. (1972) · Communications of the ACM · doi:10.1145/355604.361592 · Cited by 34
Addressing Mechanisms for Large Virtual Memories
Rosenberg, J., Keedy, J. L., & Abramson, D. (1992) · The Computer Journal · doi:10.1093/comjnl/35.4.369 · Cited by 32
Software Methods to Improve Data Locality and Cache Behavior
Beyls, K. E. (2004) · Ghent University Academic Bibliography (Ghent University) · Cited by 32
Microprocessor architecture: from simple pipelines to chip multiprocessors
(2010) · Choice Reviews Online · doi:10.5860/choice.47-5691 · Cited by 31
Levels of representation of programs and the architecture of universal host machines
Rau, B. R. (1978) · ACM SIGMICRO newsletter/SIGMICRO newsletter/SIGMICRO, TCMICRO newsletter · doi:10.1145/1014198.804311 · Cited by 30
An analysis of time-sharing computer systems using Markov models
Smith, J. L. (1966) · AFIPS Spring Joint Computer Conference (SJCC) · doi:10.1145/1464182.1464192 · Cited by 30
Chrobák, M., & Noga, J. (1998) · Symposium on Discrete Algorithms · doi:10.5555/314613.314655 · Cited by 29
Programming systems and languages 1965-1975
Rosen, S. (1972) · Communications of the ACM · doi:10.1145/361454.361482 · Cited by 29
A time- and memory-sharing executive program for quick-response on-line applications
Forgie, J. W. (1965) · AFIPS Fall Joint Computer Conference (FJCC) · doi:10.1145/1463891.1463956 · Cited by 29
Decisive aspects in the evolution of microprocessors
Sima, D. (2004) · Proceedings of the IEEE · doi:10.1109/jproc.2004.837627 · Cited by 27
A use of fast and slow memories in list-processing languages
Cohen, J. (1967) · Communications of the ACM · doi:10.1145/363067.363092 · Cited by 27
Analysis of the Optimal, Look-Ahead Demand Paging Algorithms
Smith, A. J. (1976) · SIAM Journal on Computing · doi:10.1137/0205052 · Cited by 26
Cache Coherence in Distributed Systems
Kent, C. A. (1999) · Cited by 26
The Use and Performance of Memory Hierarchies: A Survey
Kuck, D. J., & Lawrie, D. H. (1970) · Elsevier eBooks · doi:10.1016/b978-0-12-395495-4.50013-1 · Cited by 26
Denning, P. J. (2021) · ACM Computing Surveys · doi:10.1145/3399709 · Cited by 25
Heat and Dump: competitive distributed paging
Awerbuch, B., Bartal, Y., & Fiat, A. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1993.366885 · Cited by 25
A time-sharing system using an associative memory
Lindquist, A. B., Seeber, R. R., & Comeau, L. W. (1966) · Proceedings of the IEEE · doi:10.1109/proc.1966.5261 · Cited by 24
Hardware-software trade-offs in a direct Rambus implementation of the RAMpage memory hierarchy
Machanick, P., Salverda, P., & Pompe, L. (1998) · ACM SIGPLAN Notices · doi:10.1145/291006.291032 · Cited by 23
Iterative Compilation and Performance Prediction for Numerical Applications
Fursin, G. (2004) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 23
An NVM Carol: Visions of NVM Past, Present, and Future
Seltzer, M., Marathe, V. J., & Byan, S. (2018) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2018.00011 · Cited by 22
Padegs, A. (1981) · IBM Journal of Research and Development · doi:10.1147/rd.255.0377 · Cited by 22
Hardware techniques to improve the performance of the processor/memory interface
Burger, D. C., & Goodman, J. R. (1998) · Cited by 22
Voorhies, D., Kirk, D. B., & Lathrop, O. (1988) · ACM SIGGRAPH Computer Graphics · doi:10.1145/378456.378517 · Cited by 22
Metadata
- Authors
- Kilburn, T., Edwards, D. B. G., Lanigan, M. J., & Sumner, F. H.
- Affiliations
- University of Manchester (GB)
- Venue
- IEEE Transactions on Electronic Computers
- Published
- 1962-04
- Volume
- EC-11
- Issue
- 2
- Pages
- 223-235
- ISSN
- 0367-7508 (ISSN-L)
- OpenAlex
- W2164155474
- Cited by
- 256
- References
- 7
- Citations by year
- 2026: 1 · 2025: 4 · 2024: 3 · 2023: 4 · 2022: 4 · 2021: 2 · 2020: 4 · 2019: 1 · 2018: 5 · 2017: 2 · 2016: 2 · 2015: 2 · 2014: 1 · 2013: 1 · 2012: 2
- FWCI
- 12.59
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Electronic Computers (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Data Storage Technologies
- Physical Sciences › Computer Science › Computer Science Applications › History of Computing Technologies
- Keywords
- core memory, drum storage, learning programs, computer architecture
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.