CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting

Anders Gidenstam ; Marina Papatriantafilou (Institutionen för data- och informationsteknik, Nätverk och system, Datakommunikation och distribuerade system (Chalmers)) ; Håkan Sundell ; Philippas Tsigas (Institutionen för data- och informationsteknik, Nätverk och system, Datakommunikation och distribuerade system (Chalmers))
IEEE Transactions on Parallel and Distributed Systems (1045-9219). Vol. 20 (2009), 8, p. 1173-1187.
[Artikel, refereegranskad vetenskaplig]

We present an efficient and practical lock-free method for semiautomatic (application-guided) memory reclamation based on reference counting, aimed for use with arbitrary lock-free dynamic data structures. The method guarantees the safety of local as well as global references, supports arbitrary memory reuse, uses atomic primitives that are available in modern computer systems, and provides an upper bound on the amount of memory waiting to be reclaimed. To the best of our knowledge, this is the first lock-free method that provides all of these properties. We provide analytical and experimental study of the method. The experiments conducted have shown that the method can also provide significant performance improvements for lock-free algorithms of dynamic data structures that require strong memory management.

Nyckelord: Memory management, memory reclamation, semiautomatic, garbage collection, data structures, lock-free, shared memory



Denna post skapades 2010-01-11. Senast ändrad 2013-08-09.
CPL Pubid: 106261

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)