Name
Abstract | ||
|---|---|---|
This paper considers the garbage collection of concurrent objects for which it is necessary to know not only “reachability,” the usual criterion for reclaiming data, but also the “state” (active or blocked) of the object. For the actor model, a more comprehensive definition than previously available is given for reclaimable actors. Two garbage collection algorithms, implementing a set of “coloring” rules, are presented and their computational complexity is analyzed. Extensions are briefly described to allow incremental, concurrent, distributed and real-time collection. It is argued that the techniques used for the actor model applies to other object-based concurrent models. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1145/97945.97961 | OOPSLA/ECOOP |
Keywords | Field | DocType |
memory management,real time,computational complexity,garbage collection | Garbage,Programming language,Computer science,Manual memory management,Data pre-processing,Theoretical computer science,Reachability,Garbage collection,Actor model,Technical report,Computational complexity theory | Conference |
Volume | Issue | ISSN |
25 | 10 | 0362-1340 |
ISBN | Citations | PageRank |
0-89791-411-2 | 32 | 2.05 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dennis G. Kafura | 1 | 745 | 134.03 |
| Douglas Washabaugh | 2 | 47 | 4.65 |
| Jeff Nelson | 3 | 32 | 2.05 |