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
Items 201–300 of 320
Memory management policies for a hardware implemented computer operating system
Kwinn, W. A. (1978) · Iowa State University Digital Repository (Iowa State University) · doi:10.31274/rtd-180813-1330 · Cited by 2
On the Apparent Continuity of Processing in a Paging Environment
Tung, C. (1970) · IEEE Transactions on Computers · doi:10.1109/t-c.1970.222831 · Cited by 2
A Time Interval Memory Protection System
Irvine, C. E., Afinidad, F. B., Levin, T. E., & Nguyen, T. D. (2005) · Cited by 2
A Survey of Architectures for Memory Resident Databases
Russell, G., & Cockshott, W. P. (1993) · Edinburgh Napier Research Repository (Edinburgh Napier University) · Cited by 2
García, F. Á. (2000) · Repositorio de la Universidad de Oviedo (RUO) · Cited by 2
Implementation of distributed orthogonal persistence using virtual memory / Francis Vaughan.
Vaughan, F. (1994) · Adelaide Research & Scholarship (AR&S) (University of Adelaide) · Cited by 2
Leveraging Non-Volatile Memory in Modern Storage Management Architectures
Lersch, L. (2021) · Qucosa (Saxon State and University Library Dresden) · Cited by 2
Applicability of buffered main memory to SYMBOL-IIR like computing structures
Agrawal, O. P. (1974) · Iowa State University Digital Repository (Iowa State University) · doi:10.31274/rtd-180813-2882 · Cited by 2
Simulation-driven exploration of NVM as a substitute for DRAM in the main memory
Palma, M. G. (2017) · doi:10.47749/t/unicamp.2017.988854 · Cited by 2
Denning, P. J. (2008) · Wiley eBooks · doi:10.1002/9780470050118.ecse960 · Cited by 2
Hardware-software trade-offs in a direct Rambus implementation of the RAMpage memory hierarchy
Machanick, P., Salverda, P., & Pompe, L. (1998) · ACM SIGOPS Operating Systems Review · doi:10.1145/384265.291032 · Cited by 2
The design and application of an extensible operating system
Doorn, L. P. V. (2001) · Digital Academic REpository of VU University Amsterdam (Vrije Universiteit Amsterdam) · Cited by 2
Hoffmann, M. (2016) · OPUS FAU (Kooperativer Bibliotheksverbund Berlin-Brandenburg (KOBV), on behalf of the Universitätsbibliothek Erlangen-Nürnberg) · Cited by 2
Managing resource sharing conflicts in an open embedded software environment
Attouchi, K. (2014) · theses.fr (ABES) · doi:10.70675/e8d8858cz6f4bz400bz95a3zdfd17f7dd746 · Cited by 2
The organization and control of a slave memory hierarchy
Gordon, R. L. (1972) · OhioLink ETD Center (Ohio Library and Information Network) · Cited by 2
Whole-system Persistence Made Efficient with Tree-structured Checkpointing on Microkernel
Dong, M., Wu, F., Mo, G., & Chen, H. (2025) · ACM Transactions on Computer Systems · doi:10.1145/3742425 · Cited by 1
The remarkable evolution of microelectronics and microprocessors: Devices that changed the world
Cervero, T., Armejach, A., Pérez, B., Moreno, J. H., & Moretó, M. (2026) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2026.105288 · Cited by 1
Cache Coherence in Distributed Systems (Thesis)
Kent, C. A. (1986) · Purdue e-Pubs (Purdue University System) · Cited by 1
Back to the Past: Segmentation with Infinite and Non-Volatile Memory
Laux, L. P., & Hexsel, R. A. (2016) · Simpósio em Sistemas Computacionais de Alto Desempenho (SSCAD) · doi:10.5753/wscad.2016.14244 · Cited by 1
Design of the G-21 multi-processor system
Quatse, J. T. (1991) · KiltHub Repository · doi:10.1184/r1/6604781 · Cited by 1
Scheduling for memory management and prefetch in embedded multi-core architectures
Carpov, S. (2011) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 1
Design of Software for On-Line Minicomputer Applications
Schoeffler, J. D. (1974) · Springer eBooks · doi:10.1007/978-1-4615-8246-5_2 · Cited by 1
Virtual memories for mini-computers
Chase, T. D., & Glorioso, R. M. (1972) · ACM Annual Conference · doi:10.1145/800193.805817 · Cited by 1
Tunnel diode storage system with non-destructive read-out
Edwards, D. B. G., & Lanigan, M. J. (1963) · Radio and Electronic Engineer · doi:10.1049/ree.1963.0156 · Cited by 1
Self-citationJacobsohn, D. H. (1964) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1964.263922 · Cited by 1
Memory-mapping techniques in a simulation problem
Bianchi, G., & Ercoli, P. (1967) · CALCOLO · doi:10.1007/bf02575669 · Cited by 1
Translation hint buffers to reduce access time of physically-addressed instruction caches
Bray, B. K., & Flynn, M. J. (1992) · ACM SIGMICRO newsletter/SIGMICRO newsletter/SIGMICRO, TCMICRO newsletter · doi:10.1145/144965.145806 · Cited by 1
PERSISTENT, OBJECT-ORIENTED AND NETWORKED
Russell, G. (1995) · Cited by 1
Architecture design methods for application domain-specific uintegrated computer systems
Soininen, J.-P. (2004) · Cited by 1
The COMPL Language and Operating System
Fraser, A. G., & Smart, J. (1966) · The Computer Journal · doi:10.1093/comjnl/9.2.144 · Cited by 1
Obfuscating Malware through Cache Memory Architecture Features
Sayin, C. (2014) · NORA - Norwegian Open Research Archives · doi:10.13140/rg.2.2.29590.45129 · Cited by 1
Operating System Techniques for Reducing Processor State Pollution
Soares, L. (2012) · TSpace (University of Toronto) · Cited by 1
Evolution of Elliott Computer Architectures
Lavington, S. (2010) · History of computing · doi:10.1007/978-1-84882-933-6_10 · Cited by 1
Hajinazar, N. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.05881 · Cited by 1
Manegold, S. (2018) · Springer eBooks · doi:10.1007/978-1-4614-8265-9_657 · Cited by 1
Hierarchical replacement decisions in hierarchical stores
Babaoğlu, Ö. (1982) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/1035332.1035296 · Cited by 1
A Time Interval Memory Protection System
Afinidad, F. B., Irvine, C. E., Nguyen, T. D., Levin, T. E., Patrick, R., Dunne, W., Elster, R., & Provost, P. (2005) · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · Cited by 1
Zero Latency Per-Task Isolation for the Hippomenes RISCV RealTime Core
Asplund, M. (2025) · DiVA (Digitala Vetenskapliga Arkivet) · Cited by 1
Cherub: A hardware distributed single shared address space memory architecture
Gull, A. (1993) · City Research Online (City University London) · Cited by 1
Gestion mémoire dans une infrastructure répartie
Gadafi, A. (2013) · theses.fr (ABES) · doi:10.70675/4dff8abfzf480z4093z87d7z5186da8dda4d · Cited by 1
An object-based processor cache.
Russell, G., & Shaw, P. (1993) · Edinburgh Napier Research Repository (Edinburgh Napier University) · Cited by 1
The Science of Computing: Virtual Memory
Denning, P. J. (1986) · American Scientist · Cited by 1
Locality-driven checkpoint and recovery
Wei, Z. (2010) · Spectrum Research Repository (Concordia University)
Augmentation of Machine Language Level
Smirnov, V. K. (1972) · Springer eBooks · doi:10.1007/978-1-4615-9053-8_1
Automatic allocation of digital computer storage resources for time-sharing
Soltis, F. G. (1968) · Iowa State University Digital Repository (Iowa State University) · doi:10.31274/rtd-180813-4787
The Profession of IT, The Locality Principle
Denning, P. J. (2005) · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School)
Electronic Computers - A Historical Survey in Print
Rosen, S. (1968) · Purdue e-Pubs (Purdue University System)
Denning, P. J. (2012) · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School)
The Hoard: Paged Virtual Memory for the Cell BE SPE
Adamczewski, J. (2011) · UTAS Research Repository · doi:10.25959/23210084
Implications of emerging DRAM technologies for the RAMpage memory hierarchy
Machanick, P., & Salverda, P. (1998) · Unisa Institutional Repository (University of South Africa)
Universelle Digital-Rechenanlagen
Händler, W., & Spies, P. P. (1974) · Springer eBooks · doi:10.1007/978-3-642-65586-9_4
Simulation exercises for computer architecture education
Knoke, P. J. (1973) · ACM SIGARCH Computer Architecture News · doi:10.1145/633642.803983
Speicherorganisation und Speicherverwaltung
Giloi, W. K. (1993) · Springer-Lehrbuch · doi:10.1007/978-3-642-58054-3_4
Using locality and interleaving information to improve shared cache performance
Yeung, D., & Liu, W. (2009) · University Libraries (University of Maryland)
PERFORMANCE OPTIMIZATION OF A STRUCTURED CFD CODE - GHOST ON COMMODITY CLUSTER ARCHITECTURES
Kristipati, P. K. (2008) · UKnowledge (University of Kentucky)
Data-driven models in storage system design
Arpaci-Dusseau, A. C., Arpaci-Dusseau, R. H., & Popovici, F. I. (2007)
Forty five years of computer architecture-all that's old is new again
Cragon, H. G. (2003) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd.1999.808599
Information and collaboration in the storage stack
Arpaci-Dusseau, A. C., Arpaci-Dusseau, R. H., & Denehy, T. E. (2006)
Virtual-Threading: Advanced General Purpose Processors ArchitecturePreprint
Yafimau, A. I. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0910.4052
Virtual Issues of Implementation
Jacob, B. (1998)
Pritchard, H. O. (2001)
Program and job-stream characteristics in the michigan terminal system
Bowler, K. H. (2011) · cIRcle (University of British Columbia) · doi:10.14288/1.0051195
Addressing Magnetic Tape on the Atlas 1 Computing Machine
Edwards, D. B. G., Aspinall, D., & Lane, R. (1966) · The Computer Journal · doi:10.1093/comjnl/8.4.323
Self-citationThe Effect of Program Behavior upon Interleaved Memory Bandwidth in a Multiprocessor Environment.
Rau, B. R. (1978) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
Review of current and future developments
Renwick, W., & Cole, A. J. (1971) · Springer eBooks · doi:10.1007/978-94-011-6887-8_11
Extending Amber with Virtual Memory
Knutsen, J. D. (2015) · NVA (Nasjonalt vitenarkiv)
Memory Management — Paging Systems
Theaker, C. J., & Brookes, G. R. (1983) · doi:10.1007/978-1-349-17138-5_10
Analyzing the behavior of loop nests in the memory hierarchy: methods, tools, and applications
Chatterjee, S., & Parker, E. (2004)
Big Vector: An External Memory Algorithm and Data Structure
Upadhyay, A. (2015) · OhioLink ETD Center (Ohio Library and Information Network)
Mandal, M. K. (1995) · OhioLink ETD Center (Ohio Library and Information Network)
A számítógépek hierarchikus lap-tárolási eljárásainak optimalizálásáról
Arató, M. (1976) · Repository of the Academy's Library (Library of the Hungarian Academy of Sciences) · doi:10.13140/2.1.4801.6008
Modelling pipelined computer architectures
Ching, P. H. Y. (1988) · Spiral (Imperial College London)
On the Virtualization of Wireless Links
van de Belt, J. (2018) · Trinity's Access to Research Output (TARA) (Trinity College Dublin)
A computer for low context-switch time
Davis, M. C., & Brooks, F. P. (1990)
A Star Is Born: Ideas and Upgrades
Lavington, S. (2019) · History of computing · doi:10.1007/978-3-030-15103-4_4
Delta uuendused ESTCube-2 pardaarvuti tarkvarale
Oro, E. (2018) · DSpace repository (University of Tartu)
Back to the Past: When Segmentation Is More Efficient Than Paging
Laux, L. P., & Hexsel, R. A. (2018) · Anais do Workshop em Desempenho de Sistemas Computacionais e de Comunicação (WPerformance) · doi:10.5753/wperformance.2018.3331
Informatikpionierleistungen aus dem deutschsprachigen Raum – Eine Schatzsuche!
Lehmann, A., Lockemann, P. C., & Nehmer, J. (2020) · Informatik-Spektrum · doi:10.1007/s00287-020-01270-7
Reducing the associativity and size of step caches in CRCW operation
Forsell, M. J. (2006) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2006.1639546
ADMINISTRATION OF SECONDARY STORAGE IN NUCLEAR CODES
Worlton, W. J. (1966) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/4527063
(2022) · Elsevier eBooks · doi:10.1016/b978-0-32-390796-5.00023-1
Thomasian, A. (2022) · Elsevier eBooks · doi:10.1016/b978-0-32-390796-5.00010-3
English, J. (2005) · doi:10.1007/978-0-230-37408-9_5
(1974) · Elsevier eBooks · doi:10.1016/b978-0-12-701750-1.50021-7
Hennessy, J. L., & Patterson, D. A. (1994) · Vieweg+Teubner eBooks · doi:10.1007/978-3-663-13953-9_8
Manegold, S. (2016) · Springer eBooks · doi:10.1007/978-1-4899-7993-3_657-2
(1970) · it - Information Technology · doi:10.1524/itit.1970.12.16.masthead
(2008) · Elsevier eBooks · doi:10.1016/b978-012379751-3.50034-5
University Research Chair (2009) · Springer eBooks · doi:10.1007/978-0-387-39940-9_3077
Baer, J.-L. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511811258.003
Translation Hint Buffers To Reduce Access Time Of Physically-addressed Instruction Caches
Bray, B. K., & Flynn, M. J. (2005) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro.1992.697019
(1978) · Elsevier eBooks · doi:10.1016/b978-0-932376-00-8.50036-0
(1993) · Elsevier eBooks · doi:10.1016/b978-0-08-036214-4.50026-9
Denning, P. J. (2014) · Chapman & Hall/CRC eBooks · doi:10.1201/b16812-62
Manegold, S. (2009) · Springer eBooks · doi:10.1007/978-0-387-39940-9_657
Simulation exercises for computer architecture education
Knoke, P. J. (1973) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/800123.803983
(2001) · CRC Press eBooks · doi:10.1201/9781420041101.bmatt
Hoffmann, D. W. (2013) · Carl Hanser Verlag GmbH & Co. KG eBooks · doi:10.3139/9783446437968.bm
Denning, P. J., & Ibbett, R. N. (2022) · Communications of the ACM · doi:10.1145/3548781
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.