Carleton University
Technical Report TR-235
March 1994
Distributed Cyclic Reference Counting
Frank Dehne & Rafael D. Lins
Abstract
We present a distributed cyclic reference counting algorithm which incorporates both, the correct management of cyclic data structures and the improvement of lazy mark-scan. The algorithm allows processors to run local mark-scan simultaneously without any need of synchronisation between phases of dierent local mark-scans either on the same processor or on dierent processors.