Generational garbage collectors are able to achieve very small pause times by concentrating on the youngest (most recently allocated) objects when collecting, since objects have been observed to die young in many systems. Generational collectors must keep track of all pointers from older to younger generations, by “monitoring” all stores into the heap. This write barrier has been implemented in a number of ways, varying essentially in the granularity of the information observed and stored. Here we examine a range of write barrier implementations and evaluate their relative performance within a generation scavenging garbage collector for Smalltalk.
@inproceedings{Hosking+1992OOPSLA,
author = {Hosking, Antony L. and Moss, J. Eliot B. and Stefanovi{\'c}, Darko},
title = {A Comparative Performance Evaluation of Write Barrier
Implementations},
booktitle = {ACM SIGPLAN Conference on Object-Oriented Programming,
Systems, Languages, and Applications},
series = {OOPSLA},
year = {1992},
pages = {92--109},
month = {October},
address = {Vancouver, Canada},
doi = {10.1145/141936.141946},
acm = {http://dl.acm.org/authorize?N93688},
gscholar = {149}
}