Results 1 - 10 of 125

Concurrent Compacting Garbage Collection of a Persistent Heap

by James O'Toole, Scott Nettles, David Gifford , 1993
"... We describe a replicating garbage collector for a persistent heap. The garbage collector cooperates with a transaction manager to provide safe and efficient transactional storage management. Clients read and write the heap in primary memory and can commit or abort their write operations. When write ..."
Abstract - Cited by 42 (8 self) - Add to MetaCart
manager and the replicating garbage collector. Our implementation is the first to provide concurrent and compacting garbage collection of a persistent heap. Measurements show that concurrent replicating collection produces significantly shorter pause times than stop-and-copy collection. For small

Concurrent Garbage Collection of Persistent Heaps

by Scott Nettles , James O'Toole, David Gifford , 1993
"... We describe the first concurrent compacting garbage collector for a persistent heap. Client threads read and write the heap in primary memory, and can independently commit or abort their write operations. When write operations are committed they are preserved in stable storage and thus survive syste ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
We describe the first concurrent compacting garbage collector for a persistent heap. Client threads read and write the heap in primary memory, and can independently commit or abort their write operations. When write operations are committed they are preserved in stable storage and thus survive

Garbage-First Garbage Collection

by David Detlefs, Christine Flood, Steve Heller, Tony Printezis , 2004
"... Garbage-First is a server-style garbage collector, targeted for multi-processors with large memories, that meets a soft real-time goal with high probability, while achieving high throughput. Whole-heap operations, such as global marking, are performed concurrently with mutation, to prevent interrupt ..."
Abstract - Cited by 73 (4 self) - Add to MetaCart
Garbage-First is a server-style garbage collector, targeted for multi-processors with large memories, that meets a soft real-time goal with high probability, while achieving high throughput. Whole-heap operations, such as global marking, are performed concurrently with mutation, to prevent

Compacting Garbage Collection with Ambiguous Roots

by Joel F. Bartlett , 1988
"... This paper introduces a copying garbage collection algorithm which is able to compact most of the accessible storage in the heap without having an explicitly defined set of pointers that contain the roots of all accessible storage. Using "hints " found in the processor’s registers and stac ..."
Abstract - Cited by 120 (3 self) - Add to MetaCart
This paper introduces a copying garbage collection algorithm which is able to compact most of the accessible storage in the heap without having an explicitly defined set of pointers that contain the roots of all accessible storage. Using "hints " found in the processor’s registers

Mostly Parallel Garbage Collection

by Hans-J. Boehm, Alan J. Demers, Scott Shenker - ACM SIGPLAN Notices , 1991
"... We present a method for adapting garbage collectors designed to run sequentially with the client, so that they may run concurrently with it. We rely on virtual memory hardware to provide information about pages that have been updated or "dirtied" during a given period of time. This method ..."
Abstract - Cited by 159 (8 self) - Add to MetaCart
We present a method for adapting garbage collectors designed to run sequentially with the client, so that they may run concurrently with it. We rely on virtual memory hardware to provide information about pages that have been updated or "dirtied" during a given period of time. This method

Concurrent Replicating Garbage Collection

by James O'Toole , Scott Nettles - IN SIGPLAN SYMPOSIUM ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION. ACM , 1994
"... We have implemented a concurrent copying garbage collector that uses replicating garbage collection. In our design, the client can continuously access the heap during garbage collection. No low-level synchronization between the client and the garbage collector is required on individual object operat ..."
Abstract - Cited by 41 (6 self) - Add to MetaCart
We have implemented a concurrent copying garbage collector that uses replicating garbage collection. In our design, the client can continuously access the heap during garbage collection. No low-level synchronization between the client and the garbage collector is required on individual object

Incremental Garbage Collection of an Almost Unidirectional Persistent Heap

by Kenneth Oksanen , 2000
"... Shades is an incremental copying garbage collection and disk crash recovery algorithm for main memory databases. Shades is also used as a runtime for a strict and persistent functional programming language. The basic, and very pervasive, idea in Shades is that only cells in the rst generation are m ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Shades is an incremental copying garbage collection and disk crash recovery algorithm for main memory databases. Shades is also used as a runtime for a strict and persistent functional programming language. The basic, and very pervasive, idea in Shades is that only cells in the rst generation

Incremental Garbage Collection of an Almost Unidirectional Persistent Heap

by unknown authors
"... Abstract Shades is an incremental copying garbage collection and disk crash recovery algorithm for main memory databases. Shades is also used as a runtime for a strict and persistent functional programming language. The basic, and very pervasive, idea in Shades is that only cells in the first genera ..."
Abstract - Add to MetaCart
Abstract Shades is an incremental copying garbage collection and disk crash recovery algorithm for main memory databases. Shades is also used as a runtime for a strict and persistent functional programming language. The basic, and very pervasive, idea in Shades is that only cells in the first

Concurrent, Atomic Garbage Collection

by David L. Detlefs , 1991
"... We describe a concurrent, atomic garbage collection algorithm for transaction-based languages, a class of languages intended to support reliable distributed systems. A garbage collection algorithm for reliable distributed systems must be atomic: a crash during a garbage collection should result in n ..."
Abstract - Cited by 13 (0 self) - Add to MetaCart
We describe a concurrent, atomic garbage collection algorithm for transaction-based languages, a class of languages intended to support reliable distributed systems. A garbage collection algorithm for reliable distributed systems must be atomic: a crash during a garbage collection should result

Index-compact garbage collection

by Liangliang Tong, Francis C. M. Lau - in: Asian Symposium on Programming Languages and Systems, 2010
"... Abstract. Automatic garbage collection is currently adopted by many object-orientedprogrammingsystems.Amongthemanyvariants,amarkcompact garbage collector offers high space efficiency and cheap object allocation, but suffers from poor virtual memory interactions. It needs to linearly scan through the ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
Abstract. Automatic garbage collection is currently adopted by many object-orientedprogrammingsystems.Amongthemanyvariants,amarkcompact garbage collector offers high space efficiency and cheap object allocation, but suffers from poor virtual memory interactions. It needs to linearly scan through
Results 1 - 10 of 125