We survey basic garbage collection algorithms, and variations such as incremental and
generational collection. The basic algorithms include reference counting, mark-sweep, mark …

Internet programming languages such as Java present new challenges to garbage-
collection design. The spectrum of garbage-collection schema for linked structures …

FG h S h UWU i SU¥ § © h SI h SQ i'w Q\ac 4 aY w UYU f KY o TQQU a U jcao Q hh UQV\ac
4 h A n 5 5 E h T ««Q h VQ f V a T h V w Q jahh W r W [WV k V af Q ª UQV w Q 5©¤ jcaj Q c …

We present the spectrum of distributed garbage collection techniques. We first describe
those reference counting-based techniques and compare them, in particular with respect to …

Efficient allocation of communication channels is critical for the performance of wireless
mobile computing systems. The centralized channel allocation algorithms proposed in …

This paper proposes Phoenix, a programming model for writing parallel and distributed
applications that accommodate dynamically joining/leaving compute resources. In the …

Tracing and reference counting are uniformly viewed as being fundamentally different
approaches to garbage collection that possess very distinct performance properties. We …

Garbage collection is a valuable tool for programming distributed systems, for all the
reasons that apply to programs that run in a single address space. In addition, network …

This paper considers the implementation of non-blocking concurrent objects on shared-
memory multiprocessors. Real multiprocessors have properties not present in theoretical …

SSP chains are a novel technique for referencing objects in a distributed system. To client
software, any object reference appears to be a local pointer, when the target is remote an …