Combining Card Marking with Remembered Sets: How to Save Scanning Time (1998)
| Citations: | 4 - 0 self |
BibTeX
@MISC{Azagury98combiningcard,
author = {Alain Azagury and Elliot K. Kolodner and Erez Petrank and Zvi Yehudai},
title = {Combining Card Marking with Remembered Sets: How to Save Scanning Time},
year = {1998}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 carcollection in the train. Keywords: Garbage collection, Generational garbage collection, The train algorithm. E-mail: azagury@haifa.vnet.ibm.com. y E-mail: kolodner@haifa.vnet.ibm.com. z E-mail: erezp@haifa.vnet.ibm.com. x E-mail: yehudai@haifa.vnet.ibm.com. Postal address (of all authors): Department of System Technology, IBM Haifa Research Lab, MATAM, Haifa 31905, Israel. 1 Introduction Genera...
Citations
| 368 | Garbage Collection: Algorithms for Automatic Dynamic Memory Managem ent.John Wiley&Sons,Ltd,1996 - Jones |
| 42 | Incremental garbage collection for mature objects - Hudson, Moss - 1992 |
| 33 | Incremental Mature Garbage Collection Using the Train Algorithm - Seligmann, Grarup - 1995 |
| 29 | A Real Time Garbage Collector Based on the Lifetimes of Objects - Lieberman, Hewitt - 1983 |
| 22 | A Fast Write Barrier for Generational Garbage Collectors - Hölzle - 1993 |
| 21 | Remembered sets can also play cards - Hosking, Hudson - 1993 |
