Abstract
We present a novel algorithm for Garbage Collection (GC) in Distributed Shared Memory systems (DSM). Our algorithm reduces the network traffic overhead (and the memory and computation overheads), essentially eliminating all communication when there is no active collection, and minimizing it when the collection process is turned on. Our algorithm works correctly for asynchronous environments where messages may experience arbitrary delays on the way to their destinations. It also tolerates arbitrary duplication of messages and is thus a suitable “add-on” for fault-tolerant communication protocols. It does not suffer from problems such as weight underflow (which arise in reference counting techniques). In addition, when applied in granularity of pages (which is the most relevant in page-based DSM systems), then the memory overhead is not inflated when the average allocation size is small, and the memory reorganization required due to the GC operations is simplified.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S.Owicki A. Birell, G. Nelson and T. Wobber. Network objects. Technical Report 115, Digital Equipment Corporation Systems Research center, February 1994.
A. Schuster A. Itzkovitz and L. Wolfovich.Supporting multiple programming paradigm on top of a single virtual parallel machine. In Proc. of the 2nd International Workshop on High-Level Parallel Programming Models and Supportive Environments, pages 25–34, Geneve, April 1997.
David I. Bevan. Distributed garbage collection using reference counting. In Parallel Architectures and Languages Europe, volume 258 of Lecture Notes in Computer Science, pages 117–187. Springer-Verlag, 1987.
P. Ferreira and M. Shapiro.Asynchronous distributed garbage collection in a cached store. INRIA Rocquencourt,France, May 1996.
Richard E. Jones and Rafael D. Lins. Cyclic weighted reference counting without delay. In Parallel Architectures and Languages Europe, volume 694 of Lecture Notes in Computer Science. Springer-Verlag, 1993.
D. Lester. Distributed garbage collection of cyclic structures. 4th International Workshop on the Parallel Implementation of Functional Languages, September 1992.
P. Dickman M. Shapiro and D. Plainfossé. Robust, distributed references and acyclic garbage collection. In ACM Symp. On Principles of Distributed Computing, Vancouver, August 1992.
A. Schuster and L. Shalev (Wolfovich). Access histories: How to use the principle of locality in distributed shared memory systems. Technical Report CS LPCR #9701, Technion, January 1997.
R.W. Topor. Termination detection for distributed computations. Information Processing Letters, 18:33–36, 1984.
P. Watson and I. Watson. An efficient garbage collection scheme for parallel computer architecture. In Parallel Architectures and Languages Europe, volume 258 of Lecture Notes in Computer Science, pages 432–443. Springer-Verlag, 1987.
W. Yu and A. Cox. Conservative garbage collection on distributed shared memory system. In Proc. Of the 16th International Conf. On Distributed Computing Systems, pages 402–410, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kogan, D., Schuster, A. (1997). Collecting garbage pages in a distributed shared memory with reduced memory and communication overhead. In: Burkard, R., Woeginger, G. (eds) Algorithms — ESA '97. ESA 1997. Lecture Notes in Computer Science, vol 1284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63397-9_24
Download citation
DOI: https://doi.org/10.1007/3-540-63397-9_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63397-6
Online ISBN: 978-3-540-69536-3
eBook Packages: Springer Book Archive