Efficient and reliable lock-free memory reclamation based on reference counting

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

Volumn 2005, Issue , 2005, Pages 202-207

  Gidenstam, Anders ^a   Papatriantafilou, Marina ^a   Sundell, Håkan ^a   Tsigas, Philippas ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; PARALLEL PROCESSING SYSTEMS;

ATOMIC PRIMITIVES; MEMORY RECLAMATION; MEMORY REUSE; REFERENCE COUNTING;

STORAGE ALLOCATION (COMPUTER);

EID: 33749683236     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPAN.2005.42     Document Type: Conference Paper

References (16)

1. D. Detlefs, P. Martin, M. Moir, and G. Steele Jr. Lock-free reference counting. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, Aug. 2001.
2. A. Gidenstam, M. Papatriantafilou, and P. Tsigas. Allocating memory in a lock-free manner. In Proceedings of the 13th Annual European Symposium on Algorithms, pages 329-242. LNCS vol. 3669, Springer Verlag, 2005.
3. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 11(1):124-149, Jan. 1991.
4. M. Herlihy, V. Luchangco, P. Martin, and M. Moir. Dynamic-sized lock-free data structures. In Proceedings of the twenty-first annual symposium on Principles of distributed computing, pages 131-131. ACM Press, 2002.
5. M. Herlihy, V. Luchangco, and M. Moir. The repeat offender problem: A mechanism for supporting dynamic-sized, lock-free data structure. In Proceedings of 16th International Symposium on Distributed Computing, Oct. 2002.
6. M. Herlihy and J. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, 1990.
7. W. H. Hesselink and J. F. Groote. Wait-free concurrent memory management by create and read until deletion (CaRuD). Distributed Computing, 14(1):31-39, Jan. 2001.
8. P. Jayanti. A complete and constant time wait-free implementation of cas from 11/sc and vice versa. In DISC 1998, pages 216-230, 1998.
9. M. M. Michael. Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing, pages 21-30, 2002.
10. M. M. Michael. Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Transactions on Parallel and Distributed Systems, 15(8), Aug. 2004.
11. M. M. Michael. Scalable lock-free dynamic memory allocation. In Proceedings of the 2004 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 35-46, June 2004.
12. M. M. Michael and M. L. Scott. Correction of a memory management method for lock-free data structures. Technical report, Computer Science, University of Rochester, 1995.
13. M. Moir. Practical implementations of non-blocking synchronization primitives. In Proceedings of the 15th Annual ACM Symposium on the Principles of Distributed Computing, Aug. 1997.
14. H. Sundell. Wait-free reference counting and memory management. In Proceedings of the 19th International Parallel & Distributed Processing Symposium. IEEE, Apr. 2005.
15. H. Sundell and P. Tsigas. Lock-free and practical doubly linked list-based deques using single-word compare-and-swap. In Proceedings of the 8th International Conference on Principles of Distributed Systems, pages 240-255. LNCS vol. 3544, Springer Verlag, Dec. 2004.
16. J.D. Valois. Lock-Free Data Structures. PhD thesis, Rensselaer Polytechnic Institute, Troy, New York, 1995.