Laws of order: Expensive synchronization in concurrent algorithms cannot be eliminated

ACM SIGPLAN Notices

Volumn 46, Issue 1, 2011, Pages 487-498

  Attiya, Hagit ^a   Guerraoui, Rachid ^b   Hendler, Danny ^c   Kuznetsov, Petr ^d   Michael, Maged M ^e   Vechev, Martin ^e  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b EPFL   (Switzerland)

^c BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^d TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

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

Author keywords

Algorithms; Concurrency; Lower Bounds; Memory Barriers; Memory Fences

Indexed keywords

ATOMIC OPERATION; CONCURRENCY; CONCURRENT ALGORITHMS; ERROR PRONES; LOWER BOUNDS; MEMORY BARRIERS; MEMORY FENCES; MEMORY ORDERING; MUTUAL EXCLUSIONS; SHARED VARIABLES; TRIAL-AND-ERROR PROCESS; WRITE OPERATIONS;

ATOMS; DESIGN; FENCES; SYNCHRONIZATION;

ALGORITHMS;

EID: 79251562557     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1925844.1926442     Document Type: Conference Paper

References (45)

1. Sarita V. Advee and Kourosh Gharachorloo. Shared memory consistency models: A tutorial. IEEE Computer, 29(12):66-76, 1996.
2. Thomas E. Anderson. The performance of spin lock alternatives for shared-money multiprocessors. IEEE Trans. Parallel Distrib. Syst., 1(1):6-16, 1990.
3. Nimar S. Arora, Robert D. Blumofe, and C. Greg Plaxton. Thread scheduling for multiprogrammed multiprocessors. In Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA, pages 119-129, June 1998.
4. Hagit Attiya, Faith Fich, and Yaniv Kaplan. Lower bounds for adaptive collect and related objects. In Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, pages 60- 69, 2004.
5. Hagit Attiya, Alla Gorbach, and Shlomo Moran. Computing in totally anonymous asynchronous shared memory systems. Information and Computation, 173(2):162-183, March 2002.
6. Yoah Bar-David and Gadi Taubenfeld. Automatic discovery of mutual exclusion algorithms. In Proceedings of the 17th International Conference on Distributed Computing, DISC, pages 136-150, 2003.
7. Hans-J. Boehm. Reordering constraints for pthread-style locks. In Proceedings of the Twevelth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP, pages 173-182, 2007.
8. Sebastian Burckhardt, Chris Dern, Madanlal Musuvathi, and Roy Tan. Line-up: A complete and automatic linearizability checker. In PLDI'10: Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation, pages 330-340, New York, NY, USA, 2010. ACM.
9. James Burns and Nancy Lynch. Bounds on shared memory for mutual exclusion. Information and Computation, 107(2):171-184, December 1993.
10. David Chase and Yossi Lev. Dynamic circular work-stealing deque. In Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, pages 21-28, July 2005.
11. EdsgerW. Dijkstra. Solution of a problem in concurrent programming control. Commun. ACM, 8(9):569, 1965.
12. Faith Ellen, Panagiota Fatourou, and Eric Ruppert. Time lower bounds for implementations of multi-writer snapshots. Journal of the ACM, 54(6):30, 2007.
13. Faith Fich, Danny Hendler, and Nir Shavit. On the inherent weakness of conditional primitives. Distributed Computing, 18(4):267-277, 2006.
14. Faith Fich, Maurice Herlihy, and Nir Shavit. On the space complexity of randomized synchronization. Journal of the ACM, 45(5):843-862, September 1998.
15. Faith Fich, Victor Luchangco, Mark Moir, and Nir Shavit. Obstruction-free step complexity: Lock-free dcas as an example. In DISC, pages 493-494, 2005.
16. Matteo Frigo, Charles E. Leiserson, and Keith H. Randall. The implementation of the cilk-5 multithreaded language. In Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation, PLDI, pages 212-223, June 1998.
17. James R. Goodman. Cache consistency and sequential consistency. Technical report, 1989. Technical report 61.
18. Gary Graunke and Shreekant S. Thakkar. Synchronization algorithms for shared-memory multiprocessors. IEEE Computer, 23(6):60-69, 1990.
19. Danny Hendler, Yossi Lev, Mark Moir, and Nir Shavit. A dynamicsized nonblocking work stealing deque. Distributed Computing, 18(3):189-207, 2006.
20. Danny Hendler and Nir Shavit. Non-blocking steal-half work queues. In Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, pages 280-289, July 2002.
21. Maurice Herlihy. Wait-free synchronization. ACM Trans. Program. Lang. Syst., 13(1):124-149, 1991.
22. Maurice Herlihy and Nir Shavit. The art of multiprocessor programming. Morgan Kaufmann, 2008.
23. Maurice Herlihy and Jeannette Wing. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst., 12(3):463-492, 1990.
24. Lisa Higham and Jalal Kawash. Java: Memory consistency and process coordination. In DISC, pages 201-215, 1998.
25. Lisa Higham and Jalal Kawash. Bounds for mutual exclusion with only processor consistency. In DISC, pages 44-58, 2000.
26. IBM System/370 Extended Architecture, Principles of Operation, 1983. Publication No. SA22-7085.
27. Prasad Jayanti, King Tan, and Sam Toueg. Time and space lower bounds for nonblocking implementations. SIAM Journal on Computing, 30(2):438-456, 2000.
28. Jalal Kawash. Limitations and Capabilities of Weak Memory Consistency Systems. PhD thesis, University of Calgary, January 2000.
29. Michael Kuperstein, Martin Vechev, and Eran Yahav. Automatic inference of memory fences. In Formal Methods in Computer Aided Design, 2010.
30. Leslie Lamport. Specifying concurrent program modules. ACM Trans. Program. Lang. Syst., 5(2):190-222, April 1983.
31. Leslie Lamport. The mutual exclusion problem: Part II - statement and solutions. J. ACM, 33(2):327-348, 1986. (Pubitemid 16533226)
32. Leslie Lamport. A fast mutual exclusion algorithm. ACM Trans. Comput. Syst., 5(1):1-11, 1987.
33. Jaejin Lee. Compilation Techniques for Explicitly Parallel Programs. PhD thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, 1999.
34. Victor Luchangco, Mark Moir, and Nir Shavit. On the uncontended complexity of consensus. In Proceedings of the 17th International Conference on Distributed Computing, pages 45-59, October 2003.
35. Paul E. McKenney. Memory barriers: A hardware view for software hackers. Linux Technology Center, IBM Beaverton, June 2010.
36. John M. Mellor-Crummey and Michael L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst., 9(1):21-65, 1991.
37. Maged M. Michael and Michael L. Scott. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, pages 267-275, May 1996.
38. Maged M. Michael, Martin T. Vechev, and Vijay Saraswat. Idempotent work stealing. In Proceedings of the Fourteenth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP, pages 45-54, February 2009.
39. Shlomo Moran, Gadi Taubenfeld, and Irit Yadin. Concurrent counting. Journal of Computer and System Sciences, 53(1):61-78, August 1996.
40. Scott Owens, Susmit Sarkar, and Peter Sewell. A better x86 memory model: X86-tso. In TPHOLs, pages 391-407, 2009.
41. Gary L. Peterson. Myths about the mutual exclusion problem. Inf. Process. Lett., 12(3):115-116, 1981.
42. Vijay A. Saraswat, Radha Jagadeesan, Maged M. Michael, and Christoph von Praun. A theory of memory models. In Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, pages 161-172, March 2007.
43. Susmit Sarkar, Peter Sewell, Francesco Zappa Nardelli, Scott Owens, Tom Ridge, Thomas Braibant, Magnus O. Myreen, and Jade Alglave. The semantics of x86-cc multiprocessor machine code. In POPL, pages 379-391, 2009.
44. William E. Weihl. Commutativity-based concurrency control for abstract data types. IEEE Trans. Computers, 37(12):1488-1505, 1988.
45. Glynn Winskel. The Formal Semantics of Programming Languages. MIT Press, 1993.