Next: Distributed PICT Up: Programming Languages Previous: The Join Calculus Language
Le Fessant, Piumarta, and Shapiro expanded an acyclic distributed garbage collector (the cleanup protocol of Stub-Scion Pair Chains) with a detector of distributed cycles of free cells. The whole results in a complete and asynchronous distributed garbage collector.
The detection algorithm for free cycles is inspired by Hughes. A local collector marks outgoing references with dates, which are propagated asynchronously between spaces. A central server computes the minimal allowed dates, permitting cycles to be detected, cut and further collected.
This new algorithm is asynchronous and fault-tolerant. Furthermore, it can be adapted to large-scale systems. It also requires few resources and is easy to implement. In the mid-range, it will be included in a future release of the Join Calculus language.
C. Fournet, C. Laneve, L. Maranget, and D. Rémy.
Implicit typing à la ML for the join-calculus.
In A. Mazurkiewicz and J. Winkowski, editors, CONCUR '97: Concurrency Theory (8th International Conference, Warsaw, Poland, July 1997), volume 1243 of LNCS, pages 196-212. Springer, 1997.
F. le Fessant, I. Piumarta, and M. Shapiro,
An implementation for complete asynchronous distributed garbage collection.
Submitted for publication, November 1997, available electronically ( http:www-sor.inria.frdocs).
C. Fournet and L. Maranget.
The join-calculus language.
Available electronically (http://pauillac.inria.fr/join), June 1997.
Some results in the join-calculus.
In M. Abadi and T. Ito, editors, TACS '97: Theoretical Aspects of Computer Software, volume 1281 of LNCS, pages 233-249. Springer, 1997.