Wait-free reference counting and memory management

Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

Volumn 2005, Issue , 2005, Pages

  Sundell, Håkan ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ATOMIC PRIMITIVE; CONCURRENT ALLOCATION; GARBAGE COLLECTION SCHEME; NON-BLOCKING DYNAMIC DATA STRUCTURE; REFERENCE COUNTING;

ALGORITHMS; CONCURRENCY CONTROL; DATA STORAGE EQUIPMENT; DATA STRUCTURES; REAL TIME SYSTEMS;

STORAGE ALLOCATION (COMPUTER);

EID: 33746290001     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2005.451     Document Type: Conference Paper

References (24)

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. H. Gao, J. F. Groote, and W. H. Hesselink. Almost wait-free resizable hashtables. In 18th International Parallel and Distributed Processing Symposium, page 50a, Apr. 2004.
3. A. Gidenstam, M. Papatriantafilou, and P. Tsigas. Allocating memory in a lock-free manner. Technical Report 2004-04, Computing Science, Chalmers University of Technology, 2004.
4. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 11(1):124-149, Jan. 1991.
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. T. Herman and V. Damian-Iordache. Space-optimal wait-free queues. In Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, page 280. ACM Press, 1997.
8. W. H. Hesselink and J. F. Groote. Waitfree distributed memory management by create and read until deletion (CRUD). Technical Report SEN-R9811, CWI, Amsterdam, 1998.
9. 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.
10. P. Jayanti. A complete and constant time wait-free implementation of cas from ll/sc and vice versa. In DISC 1998, pages 216-230, 1998.
11. Y. Levanoni and E. Petrank. A scalable reference counting garbage collector. Technical Report CS-0967, Haifa, Israel, 1999.
12. 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.
13. M. M. Michael. Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Transactions on Parallel and Distributed Systems, 15(8), Aug. 2004.
14. 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.
15. M. M. Michael and M. L. Scott. Correction of a memory management method for lock-free data structures. Technical report, Computer Science Department, University of Rochester, 1995.
16. 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.
17. R. Rajkumar. Synchronization in Real-Time Systems: A Priority Inheritance Approach. Kluwer Academic Publishers, 1991.
18. O. Shalev and N. Shavit. Split-ordered lists: lock-free extensible hash tables. In Proceedings of the twenty-second annual symposium on Principles of distributed computing, pages 102-111. ACM Press, 2003.
19. H. Sundeil. Efficient and Practical Non-Blocking Data Structures. PhD thesis, Department of Computing Science, Chalmers University of Technology, Nov. 2004.
20. H. Sundell and P. Tsigas. NOBLE: A non-blocking interprocess communication library. In Proceedings of the 6th Workshop on Languages, Compilers and Run-time Systems for Scalable Computers, 2002.
21. H. Sundell and P. Tsigas. Fast and lock-free concurrent priority queues for multi-thread systems. In Proceedings of the 17th International Parallel and Distributed Processing Symposium, page 11. IEEE press, Apr. 2003.
22. 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, Dec. 2004.
23. P. Tsigas and Y. Zhang. A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems. In Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 134-143. ACM press, 2001.
24. J. D. Valois. Lock-Free Data Structures. PhD thesis, Rensselaer Polytechnic Institute, Troy, New York, 1995.