Sketch based Distributed Garbage Collection, Theory and Empirical Elements

Abstract : Object-Oriented Programming (OOP) is a pillar of actual, and most probably future, software engineering. Within the advances for OOP, Garbage Collection (GC) is one the major improvements that brought both large productivity and reliability benefits. Yet, to our knowledge, no widely used distributed systems benefit from a complete Distributed Garbage Collector (DGC) at this time. We believe that this situation is due, a least partly, to actual DGC performance issues. In this paper, we introduce the idea of sketch based DGC where object-graph fragments are sketched rather than explicitly represented. We prove, under reasonable assumptions that sketched messages are smaller up to one order of magnitude than their explicit counterparts. Those results apply to most of state-of-art DGC methods. In the case of the Veiga and Ferreira DGC algorithm, the improvement is more than a factor~4 under very limited assumptions.
Complete list of metadatas
Contributor : Joannès Vermorel <>
Submitted on : Tuesday, November 29, 2005 - 6:17:50 PM
Last modification on : Tuesday, March 27, 2018 - 4:06:18 PM
Long-term archiving on : Monday, June 27, 2011 - 3:10:57 PM


  • HAL Id : hal-00013011, version 4


Joannès Vermorel. Sketch based Distributed Garbage Collection, Theory and Empirical Elements. 2005. ⟨hal-00013011v4⟩



Record views


Files downloads