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
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.