Selective sweeping

Authors:
Yoo C. Chung;Soo-Mook Moon;Kemal Ebcioğlu;Dan Sahlin
Affiliations:
School of Electrical Engineering, Seoul National University, Kwanak, P.O. Box 34, Seoul 151-742, South Korea;School of Electrical Engineering, Seoul National University, Kwanak, P.O. Box 34, Seoul 151-742, South Korea;-;Computer Science Laboratory, Ericsson Utvecklings AB, Box 1505, SE-125 25 Aalvsjoe, Sweden
Venue:
Software—Practice & Experience
Year:
2005

Citing 8
Cited 2

Garbage collection can be faster than stack allocation

Information Processing Letters
Garbage collection in an uncooperative environment

Software—Practice & Experience
The treadmill: real-time garbage collection without motion sickness

ACM SIGPLAN Notices
Reducing sweep time for a nearly empty heap

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reducing garbage collector cache misses

Proceedings of the 2nd international symposium on Memory management
Memory allocation with lazy fits

Proceedings of the 2nd international symposium on Memory management
A nonrecursive list compacting algorithm

Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM

Mark and split

Proceedings of the 5th international symposium on Memory management
An efficient non-moving garbage collector for functional languages

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditional mark and sweep garbage collectors use time proportional to the heap size when sweeping memory, since all objects in the heap, dead or alive, must be traversed. Here we introduce a sweeping algorithm which traverses only the live objects. Since this sweeping algorithm is slower when the heap occupancy is high, we also discuss how to avoid this slowdown by using an adaptive algorithm.