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 101–200 of 320
CARAT: a case for virtual memory through compiler- and runtime-based address translation
Suchy, B., Campanoni, S., Hardavellas, N., & Dinda, P. A. (2020) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3385412.3385987 · Cited by 21
Hardware-software trade-offs in a direct Rambus implementation of the RAMpage memory hierarchy
Machanick, P., Salverda, P., & Pompe, L. (1998) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/291069.291032 · Cited by 21
High-Performance Operations Using a Compressed Database Architecture
Cockshott, W. P. (1998) · The Computer Journal · doi:10.1093/comjnl/41.5.283 · Cited by 21
Introduction to System Programming
Blum, E. K., & Wegner, P. W. (1965) · Mathematics of Computation · doi:10.2307/2003724 · Cited by 21
TreeSLS: A Whole-system Persistent Microkernel with Tree-structured State Checkpoint on NVM
Wu, F., Dong, M., Mo, G., & Chen, H. (2023) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/3600006.3613160 · Cited by 20
Unified Oblivious-RAM: Improving Recursive ORAM with Locality and Pseudorandomness.Preprint
Ren, L., Fletcher, C. W., Yu, X., Kwon, A., van Dijk, M., & Devadas, S. (2014) · IACR Cryptology ePrint Archive · Cited by 19
Avoiding file system micromanagement with range writes
Anand, A., Sen, S., Krioukov, A., Popovici, F. I., Akella, A., Arpaci-Dusseau, A. C., Arpaci-Dusseau, R. H., & Banerjee, S. (2008) · Operating Systems Design and Implementation · doi:10.5555/1855741.1855753 · Cited by 18
Denning, P. J. (1997) · Cited by 18
An Adaptive Replacement Algorithm for Paged-Memory Computer Systems
Thorington, J. M., & Irwin, J. D. (1972) · IEEE Transactions on Computers · doi:10.1109/t-c.1972.223451 · Cited by 18
A study of instruction cache organizations and replacement policies
Smith, J. E., & Goodman, J. R. (1983) · ACM SIGARCH Computer Architecture News · doi:10.1145/1067651.801648 · Cited by 17
New methods for immediate revocation
Karker, P. A. (2003) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.1989.36276 · Cited by 17
A Course of Study in Computer Hardware Architecture
Rossmann, G. E., Flynn, M. J., Fuller, S. H., Bell, C. G., Brooks, F. P., & Hellerman, H. (1975) · Computer · doi:10.1109/c-m.1975.218835 · Cited by 16
An Undergraduate Course on Operating Systems Principles
(1972) · Computer · doi:10.1109/c-m.1972.216866 · Cited by 16
MU6-G. a new design to achieve mainframe performance from a mini-sized computer
Edwards, D. B. G., Knowles, A. E., & Woods, J. V. (1980) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/800053.801921 · Cited by 16
Self-citationVirtual Memory and the MC68010
MacGregor, D. B., & Mothersole, D. (1983) · IEEE Micro · doi:10.1109/mm.1983.291117 · Cited by 15
An operating system structure for wide-address architectures
Chase, J. S. (1996) · Cited by 15
Haiderzai, M. D., Dakić, P., Stupavský, I., Aleksić, M., & Todorović, V. (2025) · Electronics · doi:10.3390/electronics14020334 · Cited by 14
CARAT CAKE: replacing paging via compiler/kernel cooperation
Suchy, B., Ghosh, S., Kersnar, D., Chai, S., Huang, Z., Nelson, A., Cuevas, M., Bernat, A., Chaudhary, G., Hardavellas, N., et al. (2022) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3503222.3507771 · Cited by 14
Mcgee, W. C. (1965) · IBM Systems Journal · doi:10.1147/sj.43.0184 · Cited by 14
Hardware design reflecting software requirements
Rosen, S. (1968) · AFIPS Fall Joint Computer Conference (FJCC) · doi:10.1145/1476706.1476778 · Cited by 14
Ideas for Computer Systems Organization: A Personal Survey
Barton, R. (1970) · Elsevier eBooks · doi:10.1016/b978-0-12-395495-4.50010-6 · Cited by 14
On the Design of Bayesian Storage Allocation Algorithms for Paging and Segmentation
Shemer, J. E., Someshwar, & Gupta, C. (1969) · IEEE Transactions on Computers · doi:10.1109/t-c.1969.222733 · Cited by 13
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) · ACM SIGARCH Computer Architecture News · doi:10.1145/2872887.2750379 · Cited by 12
Manchester computer architectures, 1948-75
Lavington, S. (1993) · IEEE Annals of the History of Computing · doi:10.1109/85.222841 · Cited by 12
Adaptive page replacement based on memory reference behavior
Glass, G. W., & Cao, P. (1997) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/258623.258681 · Cited by 12
Strategic directions in computer architecture
Mudge, T. (1996) · ACM Computing Surveys · doi:10.1145/242223.242271 · Cited by 12
VLSI support for a cactus stack oriented memory organization
Stenström, P. (1988) · Hawaii International Conference on System Sciences (HICSS) · doi:10.1109/hicss.1988.11768 · Cited by 12
Structure of a cryogenic associative processor
Barnard, J. D., Behnke, F. A., Lindquist, A. B., & Seeber, R. R. (1964) · Proceedings of the IEEE · doi:10.1109/proc.1964.3306 · Cited by 12
Bell (1984) · Computer · doi:10.1109/mc.1984.1659163 · Cited by 12
Hardware for information processing systems: Today and in the future
Nisenoff, N. (1966) · Proceedings of the IEEE · doi:10.1109/proc.1966.5266 · Cited by 12
Information science in a Ph.D. computer science program
Salton, G. (1969) · Communications of the ACM · doi:10.1145/362848.362871 · Cited by 11
Special Feature: Developments and Directions in Computer Architecture
Lipovski, G. J., & Doty, K. L. (1978) · Computer · doi:10.1109/c-m.1978.218313 · Cited by 11
A storage-hierarchy system for batch processing
Freeman, D. N. (1968) · AFIPS Spring Joint Computer Conference (SJCC) · doi:10.1145/1468075.1468110 · Cited by 11
Improving the efficiency of UNIX buffer caches
Braunstein, A., Riley, M., & Wilkes, J. (1989) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/74850.74858 · Cited by 11
Review and survey of mass memories
Hobbs, L. C. (1963) · AFIPS Fall Joint Computer Conference (FJCC) · doi:10.1145/1463822.1463856 · Cited by 11
HyperAlloc: Efficient VM Memory De/Inflation via Hypervisor-Shared Page-Frame Allocators
Wrenger, L., Albes, K., Wurps, M., Dietrich, C., & Lohmann, D. (2025) · European Conference on Computer Systems · doi:10.1145/3689031.3717484 · Cited by 10
Function distribution in computer system architectures
Lawson, H. W. (1976) · ACM SIGARCH Computer Architecture News · doi:10.1145/633617.803556 · Cited by 10
Computational chemistry in the 1950s.
Pritchard, H. O. (2001) · PubMed · Cited by 10
Voorhies, D., Kirk, D., & Lathrop, O. (1988) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/54852.378517 · Cited by 10
The University of Manchester MU5 project
Ibbett, R. N. (1999) · IEEE Annals of the History of Computing · doi:10.1109/85.759366 · Cited by 9
Recent Developments in Computer Organization
Brooks, F. P. (1963) · Advances in electronics and electron physics · doi:10.1016/s0065-2539(08)60833-1 · Cited by 9
Bell, G., & Pirtle, M. (1966) · Proceedings of the IEEE · doi:10.1109/proc.1966.5259 · Cited by 9
Hill, M. D., Swift, M. M., & Basu, A. (2013) · Cited by 8
Dynamic memory management in massively parallel systems: a case on GPUs
Pham, M., Li, H., Yuan, Y., Mou, C., Ramachandran, K. M., Xu, Z., & Tu, Y.-C. (2022) · International Conference on Supercomputing · doi:10.1145/3524059.3532387 · Cited by 8
Performance comparison of some shared memory organizations for 2D mesh-like NOCs
Forsell, M. J. (2010) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2010.07.003 · Cited by 8
Scalability of the RAMpage Memory Hierarchy
Machanick, P. (2000) · Unisa Institutional Repository (University of South Africa) · Cited by 8
Smart Register Files for High-Performance Microprocessors
Postiff, M. A., & Mudge, T. (1999) · Defense Technical Information Center (DTIC) · doi:10.21236/ada459519 · Cited by 8
Layered implementations of persistent object stores
Balch, P., Cockshott, W. P., & Foulk, P. W. (1989) · Software Engineering Journal · doi:10.1049/sej.1989.0015 · Cited by 8
Formal Verification of Demand Paging
Starostin, A. N., Paul, W. J., & Wilhelm, R. (2010) · Max Planck Digital Library · Cited by 8
The German TR 440 Computer: Software and Its Development
Siegert, H.-J. (2009) · IEEE Annals of the History of Computing · doi:10.1109/mahc.2009.61 · Cited by 7
Remarks on »garbage collection« using a two-level storage
Cohen, J., & Trilling, L. (1967) · BIT Numerical Mathematics · doi:10.1007/bf01934123 · Cited by 7
The OPIT system I. A file-handling scheme for data in large applications programs
Packer, J. C., & Brailsford, D. F. (1973) · Computer Physics Communications · doi:10.1016/0010-4655(73)90028-3 · Cited by 7
Hierarchical replacement decisions in hierarchical stores
Babaoğlu, Ö. (1982) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/1035293.1035296 · Cited by 6
Die Entwicklung des virtuellen Speichers
Jessen, E. (1996) · Informatik-Spektrum · doi:10.1007/s002870050034 · Cited by 6
Pyke, T. N. (1967) · Advances in computers · doi:10.1016/s0065-2458(08)60693-2 · Cited by 6
Glift: generic data structures for graphics hardware
Owens, J. D., & Lefohn, A. E. (2006) · Cited by 6
A model for address-oriented software and hardware
Smith, W. R., & Welland, R. V. (1992) · Hawaii International Conference on System Sciences (HICSS) · doi:10.1109/hicss.1992.183226 · Cited by 6
Instruction Cache Replacement Policies and Organizations
Smith, J. E., & Goodman, J. R. (1984) · Minds at UW (University of Wisconsin) · Cited by 6
Chicago, I. (. S. U. O., Fabry, R., & US Atomic Energy Commission (AEC) (1971) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/4045690 · Cited by 6
Operating Systems and Middleware: Supporting Controlled Interaction
Hailperin, M. (2006) · Cited by 6
Some Facilities for Speech Processing by Computer
Lavington, S., & Rosenthal, L. E. (1967) · The Computer Journal · doi:10.1093/comjnl/9.4.330 · Cited by 5
The Working Set Model for Program
Denning, P. J. (1968) · Cited by 5
Compiler and microarchitecture mechanisms for exploiting registers to improve memory performance.
Postiff, M. A., & Mudge, T. (2001) · Deep Blue (University of Michigan) · Cited by 5
The Motorola 88110 Superscalar RISC microprocessor
Diefendorff, K., & Allen, M. (2003) · IEEE Computer Society International Conference (COMPCON Spring) · doi:10.1109/cmpcon.1992.186702 · Cited by 5
SOME CONSIDERATIONS OF SUPERVISOR PROGRAM DESIGN FOR MULTIPLEXED COMPUTER SYSTEMS
Corbató, F. J., & Saltzer, J. H. (1968) · IFIP Congress · Cited by 5
Auslander, M. A., & Jaffe, J. F. (1999) · IBM Systems Journal · doi:10.1147/sj.382.0340 · Cited by 5
Design of the SPEEDOS operating system kernel
Espenlaub, K. (2005) · OPen Access Repositorium der Universität Ulm (OPARU) (Ulm University) · doi:10.18725/oparu-323 · Cited by 5
Sequential codelet model: a supercodelet program execution model and architecture
Diaz, M. (2021) · Library, Museums and Press - UDSpace (University of Delaware) · doi:10.58088/pm9h-cn73 · Cited by 5
Robertson, L. A. (2004) · IEEE Annals of the History of Computing · doi:10.1109/mahc.2004.22 · Cited by 4
The MU5 Multicomputer Communication System
Lavington, S., Thomas, G., & Edwards, D. B. G. (1977) · IEEE Transactions on Computers · doi:10.1109/tc.1977.5009269 · Cited by 4
Self-citationProgramming and compiling strategies for paging systems
Weinberg, G. M. (1972) · Software Practice and Experience · doi:10.1002/spe.4380020206 · Cited by 4
An Introduction to the Structure of Time-Shared Computers
Bell, C. G., & Gold, M. M. (1972) · Springer eBooks · doi:10.1007/978-1-4615-9053-8_4 · Cited by 4
Principles of computer system organization
Denning, P. J. (1970) · ACM Technical Symposium on Computer Science Education (SIGCSE) · doi:10.1145/800185.810550 · Cited by 4
A fast translation method for paging on top of segmentation
Dally, W. J. (1992) · IEEE Transactions on Computers · doi:10.1109/12.123403 · Cited by 4
The design and application of an extensible operating system
van Doorn, L. P. (2001) · Cited by 4
The KSR1: High Performance and Ease of Programming, No Longer an Oxymoron
Frank, S., Burkhardt, H., & Rothnie, J. B. (1993) · Informatik aktuell · doi:10.1007/978-3-642-78348-7_7 · Cited by 4
Improving the efficiency of UNIX buffer caches
Braunstein, A., Riley, M., & Wilkes, J. (1989) · ACM SIGOPS Operating Systems Review · doi:10.1145/74851.74858 · Cited by 4
Predicting Cache Behaviour of Concurrent Applications
Imtiaz, S., Behnam, M., Capannini, G., Carlson, J., & Jägemar, M. (2024) · IEEE International Conference on Emerging Technologies and Factory Automation (ETFA) · doi:10.1109/etfa61755.2024.10710908 · Cited by 3
RapidSwap: a Hierarchical Far Memory
Kim, H., Jo, C., Altmann, J., & Egger, B. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92916-9_12 · Cited by 3
The New Costs of Physical Memory Fragmentation
Halbuer, A., Ostapyshyn, I., Steiner, L., Wrenger, L., Jung, M., Dietrich, C., & Lohmann, D. (2024) · Workshop on Disruptive Memory Systems (DIMES) · doi:10.1145/3698783.3699378 · Cited by 3
Computer simulation of a speech-recognition system
Lavington, S. (1969) · Proceedings of the Institution of Electrical Engineers · doi:10.1049/piee.1969.0198 · Cited by 3
Special Feature: Memory Extension Techniques for Minicomputers
Poppendieck, M., & Desautels, E. J. (1977) · Computer · doi:10.1109/mc.1977.315875 · Cited by 3
On Program Placement in a Directly Executable Hierarchy of Memories
Baer, J.-L. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.224039 · Cited by 3
Software: historical perspectives and current trends
Bauer, W. F., & Rosenberg, A. M. (1972) · AFIPS Fall Joint Computer Conference (FJCC) · doi:10.1145/1480083.1480130 · Cited by 3
AEG-Telefunken TR 440: Software und Software-Entwicklung
Siegert, H.-J. (2008) · Informatik - Forschung und Entwicklung · doi:10.1007/s00450-008-0046-4 · Cited by 3
Addressable WSI: a non-redundant approach
Chesley, G. D. (1987) · ACM SIGARCH Computer Architecture News · doi:10.1145/25372.25381 · Cited by 3
Page replacement algorithm for large‐array manipulation
Muramatsu, H., & Negishi, H. (1980) · Software Practice and Experience · doi:10.1002/spe.4380100708 · Cited by 3
Memory abstractions for parallel programming
Leiserson, C. E., & Lee, I.-T. A. (2012) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 3
Dynamic storage allocation systems
Randell, B., & Kuehner, C. J. (1967) · doi:10.1145/800001.811679 · Cited by 3
Achermann, R. (2020) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-b-000400029 · Cited by 3
Managing Shared Resources in Chip Multiprocessor Memory Systems
Jahre, M. (2010) · NORA - Norwegian Open Research Archives · Cited by 3
CPU-free Computing: A Vision with a Blueprint
Trivedi, A., & Brunella, M. S. (2023) · Workshop on Hot Topics in Operating Systems · doi:10.1145/3593856.3595906 · Cited by 2
Dynamic Buffer Management in Massively Parallel Systems: The Power of Randomness
Pham, M., Yuan, Y., Li, H., Mou, C., Tu, Y.-C., Xu, Z., & Meng, J. (2024) · ACM Transactions on Parallel Computing · doi:10.1145/3701623 · Cited by 2
Goos, G., & Syrbe, M. (2008) · Springer eBooks · doi:10.1007/978-3-540-76550-9_5 · Cited by 2
Architectural Support for Software in the MONADS III Computer Design
Keedy, J. L., & Rosenberg, J. (1982) · Informatik-Fachberichte · doi:10.1007/978-3-642-68603-0_5 · Cited by 2
KRS1: high performance and ease of programming, no longer an oxymoron
Frank, S. (1993) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/165231.166113 · Cited by 2
Remarques et additions aux procédures Lisp en algol
Cohen, J. (1967) · CALCOLO · doi:10.1007/bf02641641 · Cited by 2
A programming package for some general modes of arithmetic
Brooker, R. A. (1964) · Communications of the ACM · doi:10.1145/363921.363942 · Cited by 2
Russell, G., & Cockshott, P. W. (1993) · Microprocessors and Microsystems · doi:10.1016/0141-9331(93)90042-6 · Cited by 2
Sukha, J. (2005) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2
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.