Alain Azagury, Elliot K. Kolodner, et al.
ISMM 1998
We consider the combination of card marking with remembered sets for generational garbage collection as suggested by Hosking and Hudson [3]. When more than two generations are used, a naive implementation may cause excessive and wasteful scanning of the cards and thus increase the collection time. We offer a simple data structure and a corresponding algorithm to keep track of which cards need be scanned for which generation. We then extend these ideas for the Train Algorithm of [4]. Here, the solution is more involved, and allows tracking of which card should be scanned for which car-collection in the train. © 1998 ACM.
Alain Azagury, Elliot K. Kolodner, et al.
ISMM 1998
Michael C. Jaeger, Alberto Messina, et al.
CLOSER 2013
Elliot K. Kolodner, Sivan Tal, et al.
CloudCom 2011
Ciro Formisano, Elliot K. Kolodner, et al.
Scalable Computing