Efficient and Practical Constructions of LL/SC Variables

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 22, Issue , 2003, Pages 285-294

  Jayanti, Prasad ^a   Petrovic, Srdjan ^a  

^a Dartmouth Department of Computer Science_Dartmouth College   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER HARDWARE; MULTIPROCESSING SYSTEMS; OPTIMIZATION; SEMANTICS; SYNCHRONIZATION; THEOREM PROVING;

LOCK-FREE ALGORITHMS; SYNCHRONIZATION INSTRUCTIONS;

COMPUTER SCIENCE;

EID: 1142305214     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/872035.872078     Document Type: Conference Paper

References (25)

1. Y. Afek, D. Dauber, and D. Touitou. Wait-free made fast. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 538-547, 1995.
2. J. Anderson and M. Moir. Universal constructions for large objects. In Proceedings of the 9th International Workshop on Distributed Algorithms, pages 168-182, September 1995.
3. J. Anderson and M. Moir. Universal constructions for multi-object operations. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, pages 184-194, August 1995.
4. G. Barnes. A method for implementing lock-free shared data structures. In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 261-270, 1993.
5. IBM T.J Watson Research Center. System/370 Principles of operation, 1983. Order Number GA22-7000.
6. T.D. Chandra, P. Jayanti, and K. Y. Tan. A polylog time wait-free construction for closed objects. In Proceedings of the 17th Annual Symposium on Principles of Distributed Computing, June 1998.
7. Intel Corporation. Intel Itanium Architecture Software Developer's Manual Volume 1: Application Architecture, 2002. Revision 2.1.
8. IBM Server Group. IBM e server POWER4 System Microarchitecture, 2001.
9. M. Herlihy. A methodology for implementing highly concurrent data structures. ACM Transactions on Programming Languages and Systems, 15(5):745-770, 1993.
10. SPARC International. The SPARC Architecture Manual. Version 9.
11. P. Jayanti. A complete and constant time wait-free implementation of CAS from LL/SC and vice versa. In Proceedings of the 12th International Symposium on Distributed Computing, pages 216-230, September 1998.
12. P. Jayanti. f-arrays: implementation and applications. In Proceedings of the 21st Annual Symposium on Principles of Distributed Computing, pages 270 - 279, 2002.
13. P. Jayanti. Adaptive and efficient abortable mutual exclusion. In Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing, July 2003.
14. P. Jayanti and S. Petrovic. Efficient and practical constructions of LL/SC variables (full paper). Technical Report TR 2003 446, Dartmouth College Computer Science Department, 2003.
15. M. Michael and M. Scott. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pages 267-276, May 1996.
16. 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, August 1997.
17. M. Moir. Transparent support for wait-free transactions. In Proceedings of the 11th International Workshop on Distributed Algorithms, pages 305-319, September 1997.
18. M. Moir. Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions. Distributed Computing, 14(4): 193-204, 2001.
19. S. Prakash, Y. Lee, and T. Johnson. A non-blocking algorithm for shared queues using compare&swap In Proceedings of the International Conference on Parallel Processing, volume 2, pages 68-75, 1991.
20. N. Shavit and D. Touitou. Software transactional memory. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, pages 204-213, August 1995.
21. R. Site. Alpha Architecture Reference Manual. Digital Equipment Corporation, 1992.
22. MIPS Computer Systems. MIPS64™ Architecture For Programmers Volume II: The MIPS64™ Instruction Set, 2002. Revision 1.00.
23. P. Tsigas and Y. Zhang. A simple, fast and scalable non-blocking concurrent fifo queue for shared memory multiprocessor systems. Unpublished manuscript.
24. J. Valois. Implementing lock-free queues. In Proceedings of the 7th International Conference on Parallel and Distributed Computing Systems, pages 64-69, 1994.
25. J. Valois. Lock-free linked lists using compare&swap. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, pages 214-222, August 1995.