Abstract
We introduce a new compacting garbage-collection algorithm with a very good averagecase performance. The algorithm combines the advantages of the two most frequently used algorithms for this purpose, mark-sweep and copying algorithms. The algorithm has an average time complexity that is only linear in the number of accessible edges, and it uses only a small amount of extra storage. As a subroutine, we use of a variant of the linear-probing sort algorithm that was presented and analysed by Gonnet and Munro. The distribution of the elements is “better” than uniform, thus we show a lower cost for sorting. We also give a new analysis of the cost of searching an element in the sorted table, since it is needed for the algorithm.
Preview
Unable to display preview. Download preview PDF.
References
Andrew W. Appel. Simple Generational Garbage Collection and Fast Allocation. Software-Practice and Experience, 19(2):171–183, February 1989.
Mats Bengtsson. Real-Time Compacting Garbage Collection Algorithms. Licentiate Thesis, September 1990.
Jaques Cohen. Garbage Collection of Linked Data Structures. Computing Surveys, 13(3):341–367, September 1981.
G.H. Gonnet and J.I. Munro. The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform. Journal of Algorithms, XX(5):451–470, 1984.
D. E. Knuth. The Art of Computer Programming, Volume 1: Fundamental Algorithms. Addison-Wesley, second edition, 1973. ISBN 0-201-03809-9.
D. E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, 1973. ISBN 0-201-03803-X.
H. Lieberman and C. Hewitt. A Real-Time Garbage Collector Based on the Lifetimes of Objects. Communications of the ACM, 23(6):419–429, 1983.
D. Ungar. Generation Scavenging: A Non-disruptive High Performance Storage Reclamation Algorithm. SIGPLAN Notices, 19(5):157–167, 1984.
Derek A. Zave. A Fast Compacting Garbage Collector. Information Processing Letters, 3(6):167–169, July 1975.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carlsson, S., Mattsson, C., Poblete, P.V., Bengtsson, M. (1991). A new compacting garbage-collection algorithm with a good average-case performance. In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020807
Download citation
DOI: https://doi.org/10.1007/BFb0020807
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53709-0
Online ISBN: 978-3-540-47002-1
eBook Packages: Springer Book Archive