article

Free access

Performance of a hardware-assisted real-time garbage collector

Authors:

William J. Schmidt,

Kelvin D. NilsenAuthors Info & Claims

ACM SIGPLAN Notices, Volume 29, Issue 11

Pages 76 - 85

https://doi.org/10.1145/195470.195504

Published: 01 November 1994 Publication History

Abstract

Hardware-assisted real-time garbage collection offers high throughput and small worst-case bounds on the times required to allocate dynamic objects and to access the memory contained within previously allocated objects. Whether the proposed technology is cost effective depends on various choices between configuration alternatives. This paper reports the performance of several different configurations of the hardware-assisted real-time garbage collection system subjected to several different workloads. Reported measurements demonstrate that hardware-assisted real-time garbage collection is a viable alternative to traditional explicit memory management techniques, even for low-level languages like C++.

References

[1]

A. W. Appel, Garbage collection can be faster than stack allocation, Information Processing Letters 25 (1987), pp. 275-279.

Digital Library

[2]

H. G. Baker, Jr., List processing in real time on a serial computer, Communications o/ the Association for Computer Machznery 21 (1978), pp. 280-293.

Digital Library

[3]

H. Boehm and M. Weiser, Garbage collection in an uncooperative environment, Software~Pract~ce and Experience 18 (1988), pp. 807-820.

Digital Library

[4]

R. A. Brooks, Trading data space for reduced time and code space in reM-time garbage collection on stock hardware, A CM Symposium on LISP and Functional Programming, August 1984, pp. 256-262.

Digital Library

[5]

J. R. Ellis, K. Li, and A. W. Appel, Real-time concurrent collection on stock multiprocessors, ACM $IG- PLAN '88 Conference on Programming Language Design and Implementation, 1988, pp. 11-20.

Digital Library

[6]

H. Gao and K. D. Nilsen, Rehable general purpose dynamic memory management for real-time systems, Technical Report 94-09, Department of Computer Science, Iowa State University, 1994.

[7]

J. L. Hennessy and D. A. Patterson, Computer Architecture: A Quantitative Approach, Morgan Kaufmann, San Mateo, CA, 1990.

Digital Library

[8]

S. N. Kamin, Programming Languages: An Interpreter- Based Approach, Addison-Wesley, Reading, MA, 1990.

Digital Library

[9]

D. A. Moon, Garbage collection in a large LISP system, Proceedings o/the A CM Symposium on LISP and Functional Programming, 1984, pp. 235-246.

Digital Library

[10]

D. A. Moon, Symbolics architecture, IEEE Computer 20 (1987), pp. 43-52.

Digital Library

[11]

Motorola, Power PC 601 RISC M~croprocessor User's Manual, 1993.

[12]

K. Nilsen, Garbage collection of strings and hnked data structures in real time, Software--Practice and Experience 18 (1988), pp. 613-640.

Digital Library

[13]

K. Nilsen, Reliable reM-time garbage collection of C++, omput,ng Systems 6 (1994), to appear.

Digital Library

[14]

K. D. Niisen and W. J. Schmidt, Cost-effective object-space management for hardware-assisted realtime garbage collection, A CM Letters on Programming Languages and Systems 1 (1992), pp. 338-354.

Digital Library

[15]

K. D. Nilsen and W. J. Schmidt, A high-performance hardware-assisted real-time garbage collection system, Journal oj: Programming Languages (1994), to appear.

[16]

W. J. Schmidt, Issues,n the Design and Implementation of a Real-Time Garbage Collection Architecture, PhD thesis, Iowa State University, August 1992, Available as Department of Computer Science Technical Report 92-25.

Digital Library

[17]

M. D. Tiemann, User's Gu,de to GNU C++, Free Software Foundation, 1990, Version 1.37.1. Available by anonymous ~tp from prep.ai.rait, edu.

[18]

D. M. Ungar, The Design and Evaluation of a High- Performance Smalltalk System, MIT Press, 1987.

Digital Library

[19]

D. M. Ungar, R. Blau, P. Foley, A. D. Samples, and D. Patterson, Architecture of SOAR: Smalltalk on a RISC, Proceedings o/the Eleventh Annual International Symposium on Computer Architecture, 1987, pp. 188- 197.

Digital Library

[20]

S. Wholey and S. E. Fahlman, The design of an instruction set for Common Lisp, ACM Symposium on LiSP and Functional Programming, 1984, pp. 150-158.

Digital Library

[21]

M. Wolczko and I. Williams, The influence of the object-oriented language model on a supporting architecture, 26th Hawaii Ir~ternat~onal Uonfcrencc on System Sciences, January 1993.

Cited By

Barker MEdwards SKim M(2022)Synthesized In-BramGarbage Collection for Accelerators with Immutable Memory2022 32nd International Conference on Field-Programmable Logic and Applications (FPL)10.1109/FPL57034.2022.00019(47-53)Online publication date: Aug-2022
https://doi.org/10.1109/FPL57034.2022.00019
Akram SSartor JCraeynest KHeirman WEeckhout L(2016)Boosting the Priority of GarbageACM Transactions on Architecture and Code Optimization10.1145/287542413:1(1-25)Online publication date: 7-Mar-2016
https://dl.acm.org/doi/10.1145/2875424
Bacon DCheng PShukla S(2012)And then there were noneACM SIGPLAN Notices10.1145/2345156.225406847:6(23-34)Online publication date: 11-Jun-2012
https://dl.acm.org/doi/10.1145/2345156.2254068
Show More Cited By

Recommendations

Integrated Hardware Garbage Collection

Garbage collected programming languages, such as Python and C#, have accelerated software development. These modern languages increase productivity and software reliability as they provide high-level data representation and control structures. Modern ...
List processing in real time on a serial computer

A real-time list processing system is one in which the time required by the elementary list operations (e.g. CONS, CAR, CDR, RPLACA, RPLACD, EQ, and ATOM in LISP) is bounded by a (small) constant. Classical implementations of list processing systems ...
Deep Dive into ZGC: A Modern Garbage Collector in OpenJDK
ZGC is a modern, non-generational, region-based, mostly concurrent, parallel, mark-evacuate collector recently added to OpenJDK. It aims at having GC pauses that do not grow as the heap size increases, offering low latency even with large heap sizes. The ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Copyright © 1994 ACM.

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 1994

Published in SIGPLAN Volume 29, Issue 11

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

62
Total Citations
View Citations
706
Total Downloads

Downloads (Last 12 months)87
Downloads (Last 6 weeks)24

Reflects downloads up to 02 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Barker MEdwards SKim M(2022)Synthesized In-BramGarbage Collection for Accelerators with Immutable Memory2022 32nd International Conference on Field-Programmable Logic and Applications (FPL)10.1109/FPL57034.2022.00019(47-53)Online publication date: Aug-2022
https://doi.org/10.1109/FPL57034.2022.00019
Akram SSartor JCraeynest KHeirman WEeckhout L(2016)Boosting the Priority of GarbageACM Transactions on Architecture and Code Optimization10.1145/287542413:1(1-25)Online publication date: 7-Mar-2016
https://dl.acm.org/doi/10.1145/2875424
Bacon DCheng PShukla S(2012)And then there were noneACM SIGPLAN Notices10.1145/2345156.225406847:6(23-34)Online publication date: 11-Jun-2012
https://dl.acm.org/doi/10.1145/2345156.2254068
García-Rodríguez FMiranda JGálvez J(2007)Incorporating precise garbage collection in an Ada compilerProceedings of the 12th international conference on Reliable software technologies10.5555/1769168.1769186(235-245)Online publication date: 25-Jun-2007
https://dl.acm.org/doi/10.5555/1769168.1769186
García-Rodríguez FMiranda JFortes Gálvez J(2007)Incorporating Precise Garbage Collection in an Ada CompilerReliable Software Technologies – Ada Europe 200710.1007/978-3-540-73230-3_18(235-245)Online publication date: 2007
https://doi.org/10.1007/978-3-540-73230-3_18
Wise DHeck BHess CHunt WOst E(1997)Research Demonstration of a Hardware Reference-Counting HeapLisp and Symbolic Computation10.1023/A:100771510133910:2(159-181)Online publication date: 1-Jul-1997
https://dl.acm.org/doi/10.1023/A%3A1007715101339
Ismail MSuh G(2018)Hardware-software co-optimization of memory management in dynamic languagesACM SIGPLAN Notices10.1145/3299706.321056653:5(45-58)Online publication date: 18-Jun-2018
https://dl.acm.org/doi/10.1145/3299706.3210566
Ismail MSuh GPayer HSartor J(2018)Hardware-software co-optimization of memory management in dynamic languagesProceedings of the 2018 ACM SIGPLAN International Symposium on Memory Management10.1145/3210563.3210566(45-58)Online publication date: 18-Jun-2018
https://dl.acm.org/doi/10.1145/3210563.3210566
Akram SSartor JCraeynest KHeirman WEeckhout L(2016)Boosting the Priority of GarbageACM Transactions on Architecture and Code Optimization10.1145/287542413:1(1-25)Online publication date: 7-Mar-2016
https://dl.acm.org/doi/10.1145/2875424
Bacon DCheng PShukla S(2014)Parallel real-time garbage collection of multiple heaps in reconfigurable hardwareACM SIGPLAN Notices10.1145/2775049.260299649:11(117-127)Online publication date: 12-Jun-2014
https://dl.acm.org/doi/10.1145/2775049.2602996
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents