On-the-fly garbage collection for several mutators.

Autor: Jonker, Jan
Zdroj: Distributed Computing; Dec1991, Vol. 5 Issue 4, p187-199, 13p
Abstrakt: An algorithm is given for on-the-fly garbage collection in the presence of several mutators. It uses two colours and is a generalization of Ben-Ari's algorithm (1984). The correctness proof is based on the lexical orderings of several tuples of state space functions. It is shown that in a certain sense the algorithm is optimal. Three variations of the algorithm are given and proved correct. In the case that there is only one mutator one of these variations closely resembles a well-known incorrect algorithm. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index
Externí odkaz: