article

Free access

Garbage collection for virtual memory computer systems

Author:

H. D. BaeckerAuthors Info & Claims

Communications of the ACM, Volume 15, Issue 11

Pages 981 - 986

https://doi.org/10.1145/355606.361886

Published: 01 November 1972 Publication History

PDF eReader

Abstract

In list processing there is typically a growing demand for space during program execution. This paper examines the practical implications of this growth within a virtual memory computer system, proposes two new garbage collection techniques for virtual memory systems, and compares them with traditional methods by discussion and by simulation.

References

[1]

Fenichel, R.R., and Yochelson, J.C. A LISP garbage-collector for virtual-memory computer systems. Comm. ACM 12, 11 (Nov. 1969), 611-612.

Digital Library

Google Scholar

[2]

IBM System/360 Model 67 Functional Characteristics. Form A27-2719. IBM, Kingston, N.Y. 1967.

Google Scholar

[3]

Baecker, H.D. Implementing the ALGOL 68 heap, BIT Nordisk Tidskrift for Informationsbehandling 10, 4 (1970), 405-414.

Google Scholar

[4]

Wirth, N., and Hoare, C.A.R. A contribution to the development of ALGOL. Comm. ACM 9, 6 (June 1966), 413-418.

Digital Library

Google Scholar

[5]

Bauer, H.R., et al. ALGOL WLanguage Description CS110, Computer Science Dept., Stanford U., Stanford, Calif., 1968.

Google Scholar

[6]

Knuth, D.E. The Art of Computer Programming, Vol. 2: Seminumerical Algorithms. Addison-Wesley, Reading, Mass., 1969. p. 155.

Digital Library

Google Scholar

[7]

Singleton, R.C. Algorithm 347-An efficient algorithm for sorting with minimal storage. Comm. ACM 12, 3(Mar. 1969), 185-187.

Digital Library

Google Scholar

[8]

Randell, B. A note on storage fragmentation and program segmentation. Comm. ACM 12, 7(July 1969), 365-369, 372.

Digital Library

Google Scholar

[9]

GEMINI Computer Systems: Principles of Operation. Computer Operations Inc., Costa Mesa, Calif. 1970.

Google Scholar

[10]

Welch, J.S. ZORCH. Computer Applications Inc., Washington, D.C., May 1970.

Google Scholar

[11]

Baecker, H.D. Mapped list structures. Comm. ACM 6, 8(Aug. 1963), 435-438.

Digital Library

Google Scholar

[12]

Turski, W.M. (Ed.) Efficient Production of Large Programs. Computation Centre of the Polish Academy of Sciences, Panstwowe Wydawnictiwo Naukowe, Warsaw, Poland, 1971.

Google Scholar

Cited By

View all

Hertz MKane SKeudel EBai TDing CGu XBard J(2011)Waste not, want notACM SIGPLAN Notices10.1145/2076022.199348746:11(65-76)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/2076022.1993487
Hertz MKane SKeudel EBai TDing CGu XBard JBoehm HBacon D(2011)Waste not, want notProceedings of the international symposium on Memory management10.1145/1993478.1993487(65-76)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/1993478.1993487
Tong LLau F(2010)Index-compact garbage collectionProceedings of the 8th Asian conference on Programming languages and systems10.5555/1947873.1947899(271-286)Online publication date: 28-Nov-2010
https://dl.acm.org/doi/10.5555/1947873.1947899
Show More Cited By

Recommendations

Multiprocessing compactifying garbage collection

Algorithms for a multiprocessing compactifying garbage collector are presented and discussed. The simple case of two processors, one performing LISP-like list operations and the other performing garbage collection continuously, is thoroughly examined. ...
Garbage collection without paging
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation

Garbage collection offers numerous software engineering advantages, but interacts poorly with virtual memory managers. Existing garbage collectors require far more pages than the application's working set and touch pages without regard to which ones are ...
Garbage collection without paging
PLDI '05: Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation

Garbage collection offers numerous software engineering advantages, but interacts poorly with virtual memory managers. Existing garbage collectors require far more pages than the application's working set and touch pages without regard to which ones are ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 15, Issue 11

Nov. 1972

70 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/355606

Editor:
M. Stuart Lynn
Rice Univ., Houston, TX

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1972

Published in CACM Volume 15, Issue 11

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
532
Total Downloads

Downloads (Last 12 months)64
Downloads (Last 6 weeks)11

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hertz MKane SKeudel EBai TDing CGu XBard J(2011)Waste not, want notACM SIGPLAN Notices10.1145/2076022.199348746:11(65-76)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/2076022.1993487
Hertz MKane SKeudel EBai TDing CGu XBard JBoehm HBacon D(2011)Waste not, want notProceedings of the international symposium on Memory management10.1145/1993478.1993487(65-76)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/1993478.1993487
Tong LLau F(2010)Index-compact garbage collectionProceedings of the 8th Asian conference on Programming languages and systems10.5555/1947873.1947899(271-286)Online publication date: 28-Nov-2010
https://dl.acm.org/doi/10.5555/1947873.1947899
Tong LLau F(2010)Index-Compact Garbage CollectionProgramming Languages and Systems10.1007/978-3-642-17164-2_19(271-286)Online publication date: 2010
https://doi.org/10.1007/978-3-642-17164-2_19
Hertz MFeng YBerger ESarkar VHall M(2005)Garbage collection without pagingProceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation10.1145/1065010.1065028(143-153)Online publication date: 12-Jun-2005
https://dl.acm.org/doi/10.1145/1065010.1065028
Hertz MFeng YBerger E(2005)Garbage collection without pagingACM SIGPLAN Notices10.1145/1064978.106502840:6(143-153)Online publication date: 12-Jun-2005
https://dl.acm.org/doi/10.1145/1064978.1065028
Abdullahi SRingwood G(1998)Garbage collecting the InternetACM Computing Surveys10.1145/292469.29247130:3(330-373)Online publication date: 1-Sep-1998
https://dl.acm.org/doi/10.1145/292469.292471
Zorn BKahn G(1990)Comparing mark-and sweep and stop-and-copy garbage collectionProceedings of the 1990 ACM conference on LISP and functional programming10.1145/91556.91597(87-98)Online publication date: 1-May-1990
https://dl.acm.org/doi/10.1145/91556.91597
Cohen J(1981)Garbage Collection of Linked Data StructuresACM Computing Surveys10.1145/356850.35685413:3(341-367)Online publication date: 1-Sep-1981
https://dl.acm.org/doi/10.1145/356850.356854
Brol' VKrasilov AMaslov A(1980)Programming language ALGOL 68Journal of Soviet Mathematics10.1007/BF0108898813:3(409-453)Online publication date: Mar-1980
https://doi.org/10.1007/BF01088988
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Multiprocessing compactifying garbage collection

Garbage collection without paging

Garbage collection without paging

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations