Combining card marking with remembered sets: how to save scanning time

Authors:
Alain Azagury;Elliot K. Kolodner;Erez Petrank;Zvi Yehudai
Affiliations:
Department of System Technology, IBM Haifa Research Lab, MATAM, Haifa 31905, Israel;Department of System Technology, IBM Haifa Research Lab, MATAM, Haifa 31905, Israel;Department of System Technology, IBM Haifa Research Lab, MATAM, Haifa 31905, Israel;Department of System Technology, IBM Haifa Research Lab, MATAM, Haifa 31905, Israel
Venue:
Proceedings of the 1st international symposium on Memory management
Year:
1998

Citing 8
Cited 5

A “card-marking” scheme for controlling intergenerational references in generation-based garbage collection on stock hardware

ACM SIGPLAN Notices
Garbage collection: algorithms for automatic dynamic memory management

Garbage collection: algorithms for automatic dynamic memory management
A real-time garbage collector based on the lifetimes of objects

Communications of the ACM
Incremental Collection of Mature Objects

IWMM '92 Proceedings of the International Workshop on Memory Management
Uniprocessor Garbage Collection Techniques

IWMM '92 Proceedings of the International Workshop on Memory Management
Incremental Mature Garbage Collection Using the Train Algorithm

ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming
Generation Scavenging: A non-disruptive high performance storage reclamation algorithm

SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
A Lifetime-based Garbage Collector for LISP Systems on General- Purpose Computers

A Lifetime-based Garbage Collector for LISP Systems on General- Purpose Computers

In or out?: putting write barriers in their place

Proceedings of the 3rd international symposium on Memory management
MC2: high-performance garbage collection for memory-constrained environments

OOPSLA '04 Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Barriers: friend or foe?

Proceedings of the 4th international symposium on Memory management
Task-aware garbage collection in a multi-tasking virtual machine

Proceedings of the 5th international symposium on Memory management
Barriers reconsidered, friendlier still!

Proceedings of the 2012 international symposium on Memory Management

Quantified Score

Hi-index	0.00

Visualization

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 car-collection in the train.