We assumed that a value can be checked to see if it is a forwardin time pointer in 20 instructions, and if it is, that it takes 20 more to be inserted into the remembered set. The actual cost may vary significantly from our 20 instruction overhead, depending on the data structure used to lookup the descriptor for an object given a pointer that points inside it. Antony L. Hosking and Richard L. Hudson. Remembered sets can also play cards . Fifth and last, the pointer source is inserted into the remembered set of the block corresponding to the target.
Remembered sets can also play cards .
In Moss et al.