A parallel asynchronous garbage collection algorithm for distributed systems

Author

Bagherzadeh, Nader ; Heng, Seng-lai ; Wu, Chuan-lin

Author_Institution

Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA

Volume

3

Issue

1

fYear

1991

fDate

3/1/1991 12:00:00 AM

Firstpage

100

Lastpage

107

Abstract

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

Keywords

distributed processing; parallel algorithms; storage management; Balance 8000 computer; color code; distributed systems; liveness; mutator operation; parallel asynchronous garbage collection algorithm; safety properties; simulation; Clocks; Computational modeling; Computer simulation; Concurrent computing; Distributed computing; Parallel algorithms; Performance evaluation; Safety; Sequential analysis; Synchronization;

fLanguage

English

Journal_Title

Knowledge and Data Engineering, IEEE Transactions on

Publisher

ieee

ISSN

1041-4347

Type

jour

DOI

10.1109/69.75893

Filename

75893