© 2001 IEEEThere are only a few garbage collection algorithms that have been designed to operate over massive object stores. These algorithms operate at two levels, locally via incremental collection of small partitions and globally via detection of cross partition garbage, including cyclic garbage. At each level there is a choice of collection mechanism. For example, the PMOS collector employs tracing at the local level and reference counting at the global level. Another approach implemented in the Thor object database uses tracing at both levels. In this paper we present two new algorithms that both employ reference counting at the local level. One algorithm uses reference counting at the higher level and the other uses tracing at the hig...
Tracing and reference counting are uniformly viewed as being fundamentally different approaches to g...
This paper presents a new algorithm for distributed garbage collection and outlines its implementati...
We present a garbage-collection algorithm, suitable for loosely-coupled multiprocessor systems, in w...
This paper is organised as follows. Section 2 first introduces our object model. Section 3 describes...
This paper presents an algorithm for distributed garbage collection and outlines its implementation ...
Systems that store a large number of persistent objects over many sites in a network pose new challe...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
With the continued growth of distributed systems as a means to provide shared data, designers are tu...
PhD ThesisThe provision of system-wide heap storage has a number of advantages. However, when the t...
General purpose garbage collectors have yet to combine short pause times with high throughput. For e...
peer-reviewedComprehensive distributed garbage collection in object-oriented distributed systems has...
Support for distributed co-operative work implies object sharing. The memory management of these di...
Language support of dynamic storage management simplifies the application programming task immensely...
Language support of dynamic storage management simplifies the application programming task immensely...
In this report we present a fault-tolerant and efficient algorithm for distributed garbage collectio...
Tracing and reference counting are uniformly viewed as being fundamentally different approaches to g...
This paper presents a new algorithm for distributed garbage collection and outlines its implementati...
We present a garbage-collection algorithm, suitable for loosely-coupled multiprocessor systems, in w...
This paper is organised as follows. Section 2 first introduces our object model. Section 3 describes...
This paper presents an algorithm for distributed garbage collection and outlines its implementation ...
Systems that store a large number of persistent objects over many sites in a network pose new challe...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
With the continued growth of distributed systems as a means to provide shared data, designers are tu...
PhD ThesisThe provision of system-wide heap storage has a number of advantages. However, when the t...
General purpose garbage collectors have yet to combine short pause times with high throughput. For e...
peer-reviewedComprehensive distributed garbage collection in object-oriented distributed systems has...
Support for distributed co-operative work implies object sharing. The memory management of these di...
Language support of dynamic storage management simplifies the application programming task immensely...
Language support of dynamic storage management simplifies the application programming task immensely...
In this report we present a fault-tolerant and efficient algorithm for distributed garbage collectio...
Tracing and reference counting are uniformly viewed as being fundamentally different approaches to g...
This paper presents a new algorithm for distributed garbage collection and outlines its implementati...
We present a garbage-collection algorithm, suitable for loosely-coupled multiprocessor systems, in w...