Techniques such as mobility and distribution are often used to overcome limitations of resources such as the amount of memory or the necessity for specialised devices. Indeed, questions related to such limitations are crucial in matters of security, compilation and quality of service. However, few attempts have been made at formalising this notion of resource limitation in presence of mobility,...

We analyze the performance of several copying garbage collection algorithms in a large address space offered by modern architectures. In particular, we describe the design and implementation of the RealOF garbage collector, an algorithm explicitly designed to exploit the features of 64-bit environments. This collector maintains a correspondence between object age and object placement in the add...

A reference counting garbage collector cannot reclaim unreachable cyclic structures of objects. Therefore, reference counting collectors either use a backup tracing collector seldom, or employ a cycle collectors to reclaim cyclic structures. Recently, the first on-the-fly cycle collector, that may run concurrently with program threads, was presented by Bacon and Rajan [3]. This demonstrated the...

As the development of hardware progresses, computers are expected to solve increasingly complex problems. However, solving more complex problems requires more complex software. To be able to develop these software systems, new programming languages with new features and higher abstraction levels are introduced. These features are designed to ease development, but sometimes they also make the ru...

An important property of logic object oriented functional and other high level programming languages is their automatic manage ment of dynamically allocated storage These languages often take the burden of memory management away from the programmer The language support system provides the programmer with a virtually unlimited amount of storage by running a garbage collector to reclaim storage n...

We analyze the performance of several copying garbage collection algorithms in a large address space offered by modern architectures. In particular, we describe the design and implementation of the RealOF garbage collector, an algorithm explicitly designed to exploit the features of 64-bit environments. This collector maintains a correspondence between object age and object placement in the add...

Mark and sweep garbage collectors are known for using time proportional to the heap size when sweeping memory, since all objects in the heap, regardless of whether they are live or not, must be visited in order to reclaim the memory occupied by dead objects. This paper introduces a sweeping method which traverses only the live objects, so that sweeping can be done in time dependent only on the ...

An important property of logic, object-oriented, functional, and other high-level programming languages is their automatic management of dynamically allocated storage. These languages often take the burden of memory management away from the programmer. The language support system provides the programmer with a virtually unlimited amount of storage by running a garbage collector to reclaim stora...