Real-time replication garbage collection
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
| Hi-index | 0.00 |
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 about their write operations. When write operations are committed they are preserved in stab,.e storage and thus survive system failures. Clients can freely access the heap during a garbage collection because a replica of the heap is created by the stable replica collector. A log is maintained to capture client write operations. This log is used to support both the transaction system and the replication-based garbage collection algorithm. Experimental data from our implementations was obtained from a transactional version of the SML/.NJ compiler and modified versions of the TPC-B and OO1 database benchmarks. The pause time latency results show that the prototype implementation provides significantly better latencies than stop-and-copy collection. For small transactions, throughput is limited by the logging bandwidth of the underlying log manager. The results provide strong evidence that the replication copying algorithm imposes less overhead on transaction commit operations than other algorithms.