Reordering constraints for pthread-style locks

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2007, Pages 173-182

  Boehm, Hans J ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Code reordering; Data race; Locks; Memory barriers; Memory fences; Optimization; Pthreads; Threads

Indexed keywords

COMPUTER HARDWARE; CONCURRENCY CONTROL; DIGITAL LIBRARIES; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PROGRAM COMPILERS;

CODE REORDERING; MEMORY BARRIERS; MEMORY FENCES; MEMORY VISIBILITY; UNCONTROVERSIAL RULES;

OBJECT ORIENTED PROGRAMMING;

EID: 34748859131     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1229428.1229470     Document Type: Conference Paper

References (27)

1. S. V. Adve. Designing Memory Consistency Models for Shared-Memory Multiprocessors. PhD thesis, University of Wisconsin-Madison, 1993.
2. S. V. Adve and K. Gharachorloo. Shared memory consistency models: A tutorial. IEEE Computer, 29(12):66-76, 1996.
3. S. V. Adve and M. D. Hill. Weak ordering - A new definition. In Proceedings of the 17th Annual International Symposium on Computer Architecture (ISCA'90), pages 2-14, 1990.
4. A. Alexandrescu, H.-J. Boehm, K. Henney, B. Hutchings, D. Lea, and B. Pugh. Memory model for multithreaded C++: Issues. C++ standards committee paper WG21/N1777, http ://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1777.pdf, March 2005.
5. A. Alexandrescu, H.-J. Boehm, K. Henney, D. Lea, and B. Pugh. Memory model for multithreaded C++. C++ standards committee paper WG21/N1680, http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2004/n1680.pdf, September 2004.
6. D. F. Bacon, R. Konuru, C. Murthy, and M., Serrano. Thin locks: Featherweight synchronization for Java. In Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation, pages 258-268, 1998.
7. H. Boehm, D. Lea, and B. Pugh. Memory model for multithreaded C++: August 2005 status update. C++ standards committee paper WG21/N1876, http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1876.pdf, September 2005.
8. H.-J. Boehm. Fast multiprocessor memory allocation and garbage collection. Technical Report HPL-2000-165, HP Laboratories, December 2000.
9. H.-J. Boehm. The atomicops atomic operations package, http://www.hpl.hp.com/research/linux/atomlc.ops/, 2005.
10. H.-J. Boehm. Threads cannot be implemented as a library. In Proceedings of the 2005 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 261-268, 2005.
11. G. Colvin, B. Dawes, D. Adler, and P. Dimov. The Boost shared_ptrclass template, http://www.boost.org/libs/smart.ptr/shared.ptr.htm, August 2005.
12. K. Gharachorloo. Retrospective: memory consistency and event ordering in scalable shared-memory multiprocessors. International Conference on Computer Architecture, 25 years of the international symposia on Computer architecture (selected papers), pages 67-70, 1998.
13. IEEE and The Open Group. IEEE Standard 1003.1-2001. IEEE, 2001.
14. JSR 133 Expert Group. Jsr-133: Java memory model and thread specification, http://www.cs.umd.edu/~pugh/j ava/memoryModel/jsr133.pdf, August 2004.
15. A. Krishnamurthy and K. A. Yelick. Optimizing parallel programs with explicit synchronization. In SIGPLAN Conference on Programming Language Design and Implementation, pages 196-204, 1995.
16. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9):690-691, 1979.
17. D. Lea. The JSR-133 cookbook for compiler writers, http: //gee.cs.oswego.edu/dl/jmm/cookbook.html.
18. J. Lee, D. A. Padua, and S. P. Midkiff. Basic compiler alogrithem for parallel programs. In Principles and Practice of Parallel Programming, pages 1-12, 1999.
19. G. libstc++ developers. GNU standard C++ library: libstdc++-v3. http://gcc.gnu.org/viewcvs/tags/gcc_4_1_0_release/libstdc++-v3.
20. J. Manson, W. Pugh, and S. Adve. The Java memory model (expanded version), http ://www.cs.umd.edu/users/jmanison/java/journal.pdf.
21. J. Manson, W. Pugh, and S. Adve. The Java memory model. In Conference Record of the Thirty-Second Annual ACM Symposium on Principles of Programming Languages, pages 378-391, January 2005.
22. P. E. McKenney. Exploiting Deferred Destruction: An Analysis of Read-Copy-Update Techniques in Operating System Kernels. PhD thesis, OGI School of Engineering at Oregon Health and Science University, 2004.
23. C. Nelson and H. Boehm. Sequencing and the concurrency memory model. C++ standards committee paper WG21/N2052, http://www.open-std.org/JTC1/SC22/WG21/ docs/papers/2006/n20S2.htm, September 2006.
24. B. Pugh. The Java memory model. http://www.cs.umd.edu/~pugh/java/ memoryModel/.
25. M. L. Scott and W. N. Scherer, III. Scalable queue-based spin locks with timeout. In Principles and Practice of Parallel Programming (PPOPP), pages 44-52, 2001.
26. D. Shasha and M. Snir. Efficient and correct execution of parallel programs that share memory. ACM Transactions on Programming Languages and Systems, 10(2):282-312, April 1998.
27. The Open Group and IEEE. The single UNIX specification, version 3 (IEEE standard 1003.1-2001). http://unix.org/version3/, see "Base Definitions", 4.10.