Uwe Schwiegelshohn, Franco Gasperoni, et al.
Journal of Parallel and Distributed Computing
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. Copyright © 2004 John Wiley & Sons, Ltd.
Uwe Schwiegelshohn, Franco Gasperoni, et al.
Journal of Parallel and Distributed Computing
Soo-Mook Moon, Kemal Ebcioǧlu
Computer Journal
Suhyun Kim, Soo-Mook Moon
PACT 2007
Seungil Lee, Byung-Sun Yang, et al.
JAVA 2000