Article

Free access

Guardians in a generation-based garbage collector

Authors:

R. Kent Dybvig,

Carl Bruggeman,

David EbyAuthors Info & Claims

PLDI '93: Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation

Pages 207 - 216

https://doi.org/10.1145/155090.155110

Published: 01 June 1993 Publication History

PDF eReader

Abstract

This paper describes a new language feature that allows dynamically allocated objects to be saved from deallocation by an automatic storage management system so that clean-up or other actions can be performed using the data stored within the objects. The program has full control over the timing of clean-up actions, which eliminates several potential problems and often eliminates the need for critical sections in code that interacts with clean-up actions. Our implementation is “generation-friendly” in the sense that the additional overhead within a generation-based garbage collector is proportional to the work already done there, and the overhead within the mutator is proportional to the number of clean-up actions actually performed.

References

[1]

Martin C. Atkins. Implementation Techniques for Object-Oriented Systems. PhD thesis, University of York, 1989.

Digital Library

Google Scholar

[2]

G. E. Collins. A method for overlapping and erasure of lists. Communications of the A C'M, 3(12):655-657, December 1960.

Digital Library

Google Scholar

[3]

Ken Dickey. private communication.

Google Scholar

[4]

R. Kent Dybvig, David Eby, and Carl Bruggeman. Flexible and efficient storage management using a segmented heap. in preparation.

Google Scholar

[5]

R. Kent Dybvig and Robert Hieb. A new approach to procedures with variable arity. Lisp and Symbolic Computation, 3(3):229-244, September 1990.

Digital Library

Google Scholar

[6]

Daniel P. Friedman and David S. Wise. Garbage collecting a heap which includes a scatter table. Information Processing Letters, 5(6), December 1976.

Crossref

Google Scholar

[7]

Barry Hayes. Finalization in the collector interface. in Proceedings of the International Workshop on Memory Management IWMM92, pages 277-298, St. Malo, France, September 1992. Springer-Verlag.

Digital Library

Google Scholar

[8]

Donald E. Knuth. The Art of Computer Programming, Volume I: Fundamental Algorithms. Addison-Wesley, Reading, Mass., second edition, 1973.

Digital Library

Google Scholar

[9]

Henry Lieberman and Carl Hewitt. A real-time garbage collector based on the lifetimes of objects. Communications of the A CM, 26(6):419-429, June 1983.

Digital Library

Google Scholar

[10]

james S. Miller. MultiScheme: A Parallel Processing System Based on MIT Scheme. PhD thesis, Massachusetts Institute of Technology, September 1987.

Google Scholar

[11]

Jonathan A. Rees, Norman I. Adams, and James R. Meehan. The T Manual, fourth edition, September 1988.

Google Scholar

Cited By

View all

Flatt MDerici CDybvig RKeep AMassaccesi GSpall STobin-Hochstadt SZeppieri J(2019)Rebuilding racket on chez scheme (experience report)Proceedings of the ACM on Programming Languages10.1145/33416423:ICFP(1-15)Online publication date: 26-Jul-2019
https://dl.acm.org/doi/10.1145/3341642
Dai ZMao XQi YBen K(2012)Light-Weight Test Oracles for Resource Leaks Based on FinalizersProceedings of the 2012 19th Asia-Pacific Software Engineering Conference - Volume 0210.1109/APSEC.2012.27(73-79)Online publication date: 4-Dec-2012
https://dl.acm.org/doi/10.1109/APSEC.2012.27
O'Neill MBurton FHosking AAdl-Tabatabai A(2006)Smarter garbage collection with simplifiersProceedings of the 2006 workshop on Memory system performance and correctness10.1145/1178597.1178601(19-30)Online publication date: 22-Oct-2006
https://dl.acm.org/doi/10.1145/1178597.1178601
Show More Cited By

Index Terms

Guardians in a generation-based garbage collector
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
    2. General programming languages
      1. Language types

Recommendations

Guardians in a generation-based garbage collector

This paper describes a new language feature that allows dynamically allocated objects to be saved from deallocation by an automatic storage management system so that clean-up or other actions can be performed using the data stored within the objects. ...
A generational on-the-fly garbage collector for Java
PLDI '00: Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation

An on-the-fly garbage collector does not stop the program threads to perform the collection. Instead, the collector executes in a separate thread (or process) in parallel to the program. On-the-fly collectors are useful for multi-threaded applications ...
A generational on-the-fly garbage collector for Java

An on-the-fly garbage collector does not stop the program threads to perform the collection. Instead, the collector executes in a separate thread (or process) in parallel to the program. On-the-fly collectors are useful for multi-threaded applications ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

PLDI '93: Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation

August 1993

313 pages

ISBN:0897915984

DOI:10.1145/155090

Editor:
Robert Cartwright
Rice Univ., Houston, TX

ACM SIGPLAN Notices Volume 28, Issue 6
June 1993
313 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/173262
Editor:
Richard Wexelblat
IDA/CSED, Alexandria, VA
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 June 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PLDI93

Sponsor:

SIGPLAN

PLDI93: ACM SIGPLAN Conference on Programming Languages Design and Implementation

June 21 - 25, 1993

New Mexico, Albuquerque, USA

Acceptance Rates

Overall Acceptance Rate 406 of 2,067 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
532
Total Downloads

Downloads (Last 12 months)180
Downloads (Last 6 weeks)39

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Flatt MDerici CDybvig RKeep AMassaccesi GSpall STobin-Hochstadt SZeppieri J(2019)Rebuilding racket on chez scheme (experience report)Proceedings of the ACM on Programming Languages10.1145/33416423:ICFP(1-15)Online publication date: 26-Jul-2019
https://dl.acm.org/doi/10.1145/3341642
Dai ZMao XQi YBen K(2012)Light-Weight Test Oracles for Resource Leaks Based on FinalizersProceedings of the 2012 19th Asia-Pacific Software Engineering Conference - Volume 0210.1109/APSEC.2012.27(73-79)Online publication date: 4-Dec-2012
https://dl.acm.org/doi/10.1109/APSEC.2012.27
O'Neill MBurton FHosking AAdl-Tabatabai A(2006)Smarter garbage collection with simplifiersProceedings of the 2006 workshop on Memory system performance and correctness10.1145/1178597.1178601(19-30)Online publication date: 22-Oct-2006
https://dl.acm.org/doi/10.1145/1178597.1178601
Dybvig R(2006)The development of Chez SchemeACM SIGPLAN Notices10.1145/1160074.115980541:9(1-12)Online publication date: 16-Sep-2006
https://dl.acm.org/doi/10.1145/1160074.1159805
Dybvig RReppy JLawall J(2006)The development of Chez SchemeProceedings of the eleventh ACM SIGPLAN international conference on Functional programming10.1145/1159803.1159805(1-12)Online publication date: 17-Sep-2006
https://dl.acm.org/doi/10.1145/1159803.1159805
Boehm H(2003)Destructors, finalizers, and synchronizationACM SIGPLAN Notices10.1145/640128.60415338:1(262-272)Online publication date: 15-Jan-2003
https://dl.acm.org/doi/10.1145/640128.604153
Boehm HAiken AMorrisett G(2003)Destructors, finalizers, and synchronizationProceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/604131.604153(262-272)Online publication date: 15-Jan-2003
https://dl.acm.org/doi/10.1145/604131.604153
Peyton Jones SMarlow SElliott C(2000)Stretching the Storage Manager: Weak Pointers and Stable Names in HaskellImplementation of Functional Languages10.1007/10722298_3(37-58)Online publication date: 2000
https://doi.org/10.1007/10722298_3
Hayes B(2019)EphemeronsACM SIGPLAN Notices10.1145/263700.26373332:10(176-183)Online publication date: 28-Feb-2019
https://dl.acm.org/doi/10.1145/263700.263733
DAI ZMAO XLEI YWAN XBEN K(2013)Resco: Automatic Collection of Leaked ResourcesIEICE Transactions on Information and Systems10.1587/transinf.E96.D.28E96.D:1(28-39)Online publication date: 2013
https://doi.org/10.1587/transinf.E96.D.28
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Index Terms

Recommendations

Guardians in a generation-based garbage collector

A generational on-the-fly garbage collector for Java

A generational on-the-fly garbage collector for Java