CoChat
Sign Up
Cited by 407Parallel Computing and Optimization TechniquesLogic, programming, and type systemsDistributed systems and fault tolerance

The DOI matches its Crossref record.

Virtual Memory

Open access
Denning, Peter J.·1970·ACM Computing Surveys
DOI 10.1145/356571.356573
Open this paper in CoChat — free accountOpen PDF

Abstract

The need for automatic storage allocation arises from desires for program modularity, machine independence, and resource sharing.Virtual memory is an elegant way of achieving these objectives.In a virtual memory, the addresses a program may use to identify information are distinguished from the addresses the memory system uses to identify physical storage sites, and program-generated addresses are translated automatically to the corresponding machine addresses.Two principal methods for implementing virtual memory, segmentation and paging, are compared and contrasted.Many contemporary implementations have experienced one or more of these problems: poor utilization of storage, thrashing, and high costs associated with loading information into memory.These and subsidiary problems are studied from a theoretic view, and are shown to be controllable by a proper combination of hardware and memory management policies.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/356571.356573

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • Memory management techniques from virtual memory systems provide the theoretical foundation for our context hierarchy.

    “Memory management techniques from virtual memory systems [13] provide the theoretical foundation for our context hierarchy.”

    From AgentRM: An OS-Inspired Resource Manager for LLM Agent Systems (2026) · cites this paper as [13]

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

No references could be resolved yet.

Research works printed but not linked: 76

  1. ABATE J., 1969, IEEE Trans. C-18, 11, 992, 10.1109/T-C.1969.222568 · DOI
  2. ANACKER W., 1967, IEEE Trans. EC-16, 764
  3. ARDEN B. W., 1969, Proc. Second ACM Symp. on Operating Systems Principles~ Princeton, N. J., 20
  4. 10.1145/321312.321313 · DOI
  5. BASKETT F., ProP. AFIPS 1970 Spring Joint Comput. Conf., 36, 459
  6. BATSON A., 1969, Proc. Second ACM Syrup. on Operating Systems Principles, 25 155
  7. 10.1145/362946.363002 · DOI
  8. 10.1145/363011.363155 · DOI
  9. BENSOUSSAN A CLtNGEN C T. AND DAI ~Y R.C. The Multics virtual memory. Prec. Second ACM Syrup. on Operating Systems Principles Princeton N. J. Oct. 20- 22 1969 pp. 30-42. 10.1145/961053.961069 BENSOUSSAN A CLtNGEN C T. AND DAI ~Y R.C. The Multics virtual memory. Prec. Second ACM Syrup. on Operating Systems Principles Princeton N. J. Oct. 20- 22 1969 pp. 30-42. 10.1145/961053.961069 · DOI
  10. 10.1145/363162.363185 · DOI
  11. BRAWN B., Proc. AFIPS 1968 Fall Joint Comput. Conf., 1032
  12. BURROUGHS CORPORATION, 1961, Burroughs Corp.
  13. COFFMAN E. G. JR. Analysis of a drum input/output queue under scheduled operat.ion in a paged computer system d. ACM 16 t (Jan. 1969) 73-90. 10.1145/321495.321502 COFFMAN E. G. JR. Analysis of a drum input/output queue under scheduled operat.ion in a paged computer system d. ACM 16 t (Jan. 1969) 73-90. 10.1145/321495.321502 · DOI
  14. 10.1145/363397.363398 · DOI
  15. 10.1145/363067.363092 · DOI
  16. 10.1145/366786.366808 · DOI
  17. 10.1145/366786.366802 · DOI
  18. COMEAU L., 1967, Tenn., 10
  19. CORBATS F. J., 1968, Mass.
  20. 10.1145/363095.363139 · DOI
  21. DEME, 1969, Proc. 24th Nat. Conf. ACM, ACM Pub. P49, 201
  22. DENNING P., Proc. AFIPS 1967 Spring Joint Comput. Conf., 30, 9
  23. 10.1145/363095.363141 · DOI
  24. DENNING P., 1968, Mass.
  25. DENNING P., Proc. AFIPS 1968 Fall Joint Comput. Cool., 33, 915
  26. DENNING P., 1969, Trans. C-t8, 1008, 10.1109/T-C.1969.222571 · DOI
  27. 10.1145/321296.321310 · DOI
  28. DESNIS J. B., 1965, Proc. Second Congress on Information Syst. Sci., 5
  29. 10.1145/365230.365252 · DOI · Paper page
  30. DESNIS J. B., 1969, Proc. IFIP Congr. 1968, 1, 484
  31. FIKES R. E., 1968, Proc. 23rd Nat. Conf. ACM, ACM Pub. P-68, 7
  32. FINE G. H., 1966, Proc. 21st Nat. Conf. ACM, ACM Pub. P-66, 223
  33. 10.1145/366786.366800 · DOI
  34. FREIBERGS I. F., Proc. AF1PS 1968 Fall Joint Comput. Conf., 33, 1163
  35. 10.1145/363095.363142 · DOI
  36. HELLERMAN H., 1969, Proc. Second ACM Syrup. on Operating Systems Principles, 43
  37. 10.1145/366786.366795 · DOI
  38. ILIFFE J. K., 1968, American Elsevier
  39. ILIFFE J. K., Comput. d., 5, 200
  40. JOHNSTON J. B., 1969, Proc. Third Annual Princeton wonf.
  41. JONES R.M., 1969, IEEE Trans. C-I8, 11, 1004, 10.1109/T-C.1969.222570 · DOI
  42. 10.1145/366786.366806 · DOI
  43. KERNIGHAN B. W., 1969, Proc. Second ACM Syrup. on Operating Systems Principles, 47
  44. KILBURN T., 1962, Trans. EC-I1, 2, 223
  45. KNUTH D.E., 1968, Mass., 435
  46. KUCK D. J., 1969, Ill.
  47. KUBHNER C. J., Proc. AFIPS 1968 Fall Joint Comput. Conf., 33, 1011
  48. LAVE, Proc. AFIPS 1967 Fall Joint Comput. Conf., 31, 601
  49. LIPTAY S., 1968, IBM Sysl. J., 7, 1
  50. MACKENZIE F. B., 1965, Datamation, 11, 11
  51. MATTSON R. L., 1970, Evaluation Techniques for Storage Hierarchies. IBM Syst. J., 9, 2
  52. 10.1145/366663.366702 · DOI
  53. McKzLLAa A. AND COFFMAN E. G. The organization of matrices and matrix operations in a paged multiprogramming environment. Comm. ACM I2 3 (March I969) 153465. 10.1145/362875.362879 McKzLLAa A. AND COFFMAN E. G. The organization of matrices and matrix operations in a paged multiprogramming environment. Comm. ACM I2 3 (March I969) 153465. 10.1145/362875.362879 · DOI
  54. 10.1145/366786.366788 · DOI
  55. Proc. AFIPS 1967 Spring Joint Comput. Conf., 30, 611
  56. 10.1145/363095.363140 · DOI
  57. PINKERTON T. Program behavior and control in virtual storage computer systems. CONCOMP Project Rep. No. 4 U. of Mich. April 196B (Ph.D. thesis). PINKERTON T. Program behavior and control in virtual storage computer systems. CONCOMP Project Rep. No. 4 U. of Mich. April 196B (Ph.D. thesis).
  58. POOLE P. C., 1969, Proc. Second ACM Symposium on Operating Systems Principles, 19, 10.1145/961053.961063 · DOI
  59. RAMAMOORTUY C.V., 1966, Proc. 21st Nat. Conf. ACM, ACM Pub. P~66, 229
  60. 10.1145/363156.363158 · DOI
  61. 10.1145/363095.363138 · DOI
  62. 10.1145/366786.366807 · DOI
  63. 10.1145/366786.366790 · DOI
  64. 10.1145/363626.363629 · DOI
  65. SHEMER J. E., 1969, IEEE Trans. C-I8, 7, 644, 10.1109/T-C.1969.222733 · DOI
  66. SHEMER J. E., 1966, Trans. EC-t5, 6, 855
  67. 10.1145/363717.363763 · DOI
  68. STONE H. S., 1970, IEEE Trans. C, 19, 1
  69. VAREHA, 1969, Proc. Second ACM Syrup. on Operating Systems Principles, 54
  70. 10.1145/365719.365967 · DOI
  71. WEIZER N., Proc. AFIPS 1969 Spring Joint Comput. Conf., 34, 234
  72. WILKES M. V., 1965, IEEE Trans.EC-14, 270
  73. WILKES M. V., 1958, American Elsevier
  74. 10.1145/321439.321440 · DOI
  75. WILKES M. V., Proe. AFIPS 1969 Spring Joint Comput Conf., 34, 265
  76. Woumhn E. A fixed optimum cell-size for records of various lengths. J. ACM t2 1 (Jan 1965) 53-70. 10.1145/321250.321255 Woumhn E. A fixed optimum cell-size for records of various lengths. J. ACM t2 1 (Jan 1965) 53-70. 10.1145/321250.321255 · DOI

Cited by

Sorted by citations

Metadata

Authors
Denning, P. J.
Affiliations
Princeton University (US)
Corresponding author
Denning, Peter J.
ORCID
Denning, Peter J.
Venue
ACM Computing Surveys
Publisher
Association for Computing Machinery (ACM)
Published
1970-09
Volume
2
Issue
3
Pages
153-189
ISSN
  • 0360-0300 (ISSN-L)
  • 1557-7341
DOI
10.1145/356571.356573
OpenAlex
W4237211384
Cited by
407
References
0
Citations by year
2026: 6 · 2025: 7 · 2024: 3 · 2023: 6 · 2022: 6 · 2021: 4 · 2020: 6 · 2018: 4 · 2017: 7 · 2016: 3 · 2015: 5 · 2014: 11 · 2013: 8 · 2012: 4
FWCI
35.12
Type
journal article
Language
en
Open access
Licence
www.acm.org/publications/policies/copyright_policy#Background (vor)
Locations
ACM Computing Surveys (publishedVersion)
Funders
  • University of Chicago
  • University of Michigan
Topics
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Computer Science › Software › Logic, programming, and type systems
  • Physical Sciences › Computer Science › Computer Networks and Communications › Distributed systems and fault tolerance
Keywords
virtual memory, segmentation, paging, address translation, program modularity, machine independence, resource sharing, storage space utilization, thrashing

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