The Community for Technology Leaders
Green Image
<p>The problem of distributed garbage collection is discussed. An algorithm for parallel distributed asynchronous garbage collection is presented. The liveness and safety properties of this method are demonstrated. The algorithm does not require a global clock, complex termination detection methods, or distributed synchronization techniques. A new color code is introduced to distinguish between local cells (black) and those that are exclusively accessible from the remote pointers (gray). The mutator operation is revised to handle a multiple mutator scheme on a given local memory. Simulation results show that the developed distributed and parallel algorithm performs much better than the sequential method as tested on a Balance 8000 computer.</p>
simulation; parallel asynchronous garbage collection algorithm; distributed systems; liveness; safety properties; color code; mutator operation; Balance 8000 computer; distributed processing; parallel algorithms; storage management
S.-l. Heng, C.-l. Wu, N. Bagherzadeh, "A Parallel Asynchronous Garbage Collection Algorithm for Distributed Systems", IEEE Transactions on Knowledge & Data Engineering, vol. 3, no. , pp. 100-107, March 1991, doi:10.1109/69.75893
112 ms
(Ver 3.3 (11022016))