An implementation of complete, asynchronous, distributed garbage collection

被引:6
作者
Le Fessant, F [1 ]
Piumarta, I [1 ]
Shapiro, M [1 ]
机构
[1] Inst Natl Rech Informat & Automat, F-78153 Le Chesnay, France
关键词
storage management; garbage collection; reference tracking; distributed object systems;
D O I
10.1145/277652.277715
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Most existing reference-based distributed object systems include some kind of acyclic garbage collection, but fail to provide acceptable collection of cyclic garbage. Those that do provide such GC currently suffer from one or more problems: synchronous operation, the need for expensive global consensus or termination algorithms, susceptibility to communication problems, or an algorithm that does not scale. We present a simple, complete, fault-tolerant, asynchronous extension to the (acyclic) cleanup protocol of the SSP Chains system. This extension is scalable, consumes few resources, and could easily be adapted to work ill other reference-based distributed object systems-rendering them usable for very large-scale applications.
引用
收藏
页码:152 / 161
页数:10
相关论文
共 14 条
[1]  
BIRRELL A, 1993, P 14 ACM S OP SYST P, P217
[2]  
DOLIGEZ D, 1993, POPL 93, P113
[3]  
FOURNET C, 1996, LNCS, V1119
[4]  
HUDSON RL, 1997, OOPSLA
[5]  
LANG B, 1992, P 19 ANN ACM SIGPLAN
[6]  
LEROY X, 1993, 147 INRIA
[7]  
LEROY X, 1996, OBJECTIVE CAML SYSTE
[8]  
MAHESHWARI U, 1997, PRINCIPLES DISTRIBUT
[9]  
MILNER R, 1992, INFORM COMPUT, V100, P1, DOI [10.1016/0890-5401(92)90008-4, 10.1016/0890-5401(92)90009-5]
[10]  
MILNER R, 1992, INFORMATION COMPUTAT, V100, P4