Practical lock-free and wait-free LL/SC/VL implementations using 64-Bit GAS

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3274, Issue , 2004, Pages 144-158

  Michael, Maged M ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

ABA PROBLEMS; COMPARE AND SWAPS; EXPECTED TIME; LOCK-FREE; LOCK-FREE ALGORITHMS; SPACE OVERHEAD; WAIT FREE; WORK COMPLEXITY;

LOCKS (FASTENERS);

EID: 35048851250     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30186-8_11     Document Type: Article

References (12)

1. J. H. Anderson and M. Moir. Universal constructions for multi-object operations. In Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, pages 184-193, 1995.
2. M. P. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124-149, Jan. 1991.
3. M. P. Herlihy. A methodology for implementing highly concurrent objects. ACM Transactions on Programming Languages and Systems, 15(5):745-770, Nov. 1993.
4. M. P. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, July 1990.
5. IBM System/370 Extended Architecture, Principles of Operation, 1983. Publication No. SA22-7085.
6. P. Jayanti. A complete and constant time wait-free implementation of CAS from LL/SC and vice versa. In Proceedings of the Twelfth International Symposium on Distributed Computing, pages 216-230, Sept. 1998.
7. P. Jayanti and S. Petrovic. Efficient and practical constructions of LL/SC variables. In Proceedings of the Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, pages 285-294, July 2003.
8. M. M. Michael. ABA prevention using single-word instructions. Technical Report RC 23089, IBM T. J. Watson Research Center, Jan. 2004.
9. M. M. Michael. Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Transactions on Parallel and Distributed Systems, 15(6):491-504, June 2004. Earlier version in 21st PODC, pages 21-30, July 2002.
10. 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.
11. M. Moir. Practical implementations of non-blocking synchronization primitives. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pages 219-228, Aug. 1997.
12. PowerPC Microprocessor Family: The Programming Environment, 1991.