Global garbage collection for distributed heap storage systems
Number of Authors: 2
1987 (English)Report (Refereed)
We present a garbage-collection algorithm, suitable for loosely-coupled multiprocessor systems, in which the processing elements (PE's) share only the communication medium. The algorithm is global, i.e. it involves all the PE's in the system. It allows space compaction, and it uses a system-wide marking phase to mark all accessible objects where a combination of parallel breadth-first/depth-first strategies is used for tracing the object-graphs according to a decentralized credit mechanism that regulates the number of garbage collection messages in the system. The credit mechanism is crucial for determining the space requirement of the garbage-collection messages. Also a variation of the above algorithm is presented for systems with high locality of reference. It allows each PE to perform first its local garbage collection and only invokes the global garbage collection when the freed space by the local collector is insufficient.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1987, 1. , 36 p.
SICS Research Report, ISSN 0283-3638 ; R87:05
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-14403OAI: oai:DiVA.org:ri-14403DiVA: diva2:1035692
Original report number R87005. Also published in the International Journal of Parallel Programming. Vol. 15, No. 5, October 1986, pp. 339-387.2016-10-132016-10-13