Remembered sets can also play cards . In Moss et al. 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. A synthetic program that builds a large binary tree, then repeatedly replaces randomly chosen subtrees at fixed height with newly built subtrees. This benchmark was named Destroy in Ref. Tree Replace Random is a variant which replaces subtrees at randomly chosen heights. The well known operating system event driven simulation benchmark.