Can seqlocks get along with programming language memory models

Proceedings of the 2012 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness, MSPC'12

Volumn , Issue , 2012, Pages 12-20

  Boehm, Hans J ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Atomic operations; C++; Fences; Java; Memory model; Reader writer locks; Seqlocks; Sequence numbers

Indexed keywords

ATOMIC OPERATION; C++; JAVA; MEMORY MODELS; SEQLOCKS; SEQUENCE NUMBER;

FENCES; LOCKS (FASTENERS);

HIGH LEVEL LANGUAGES;

EID: 84863486580     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2247684.2247688     Document Type: Conference Paper

References (21)

1. S. V. Adve and H.-J. Boehm. Memory models: A case for rethinking parallel languages and hardware. Communications of the ACM, 53(8):90-101, August 2010.
2. M. Batty, K. Memarian, S. Owens, S. Sarkar, and P. Sewell. Clarifying and compiling C/C++ concurrency: From C++11 to POWER. In POPL'12, 2012.
3. M. Batty, S. Owens, S. Sarkar, P. Sewell, and T. Weber. Mathematizing C++ concurrency. In POPL'11, pages 55-66, 2011.
4. H.-J. Boehm. The atomic ops atomic operations package. http://www.hpl.hp.com/research/linux/atomic-ops/2005.
5. H.-J. Boehm. Reordering constraints for pthread-style locks. In Proc. 12th Symp. Principles and Practice of Parallel Programming, pages 173-182, 2007. (Pubitemid 47479105)
6. H.-J. Boehm. How to miscompile programs with "benign" data races. In HotPar, 2011.
7. H.-J. Boehm. Performance implications of fence-based memory models. In MSPC, 2011.
8. H.-J. Boehm and S. Adve. Foundations of the C++ concurrency memory model. In Proc. Conf. on Programming Language Design and Implementation, pages 68-78, 2008.
9. A. Dragojevic, R. Guerraoui, and M. Kapalka. Stretching transactional memory. In PLDI, 2009.
10. S. Hemminger. Fast reader/writer lock for gettimeofday 2.5.30. Linux kernel mailing list August 12, 2002, http://lwn.net/Articles/7388/.
11. ISO JTC1/SC22/WG21. ISO/IEC 14882:2011, information technology - programming languages - C++. http://www.iso.org/iso/iso-catalogue/catalogue-tc/ catalogue-detail.htm?csnumber=50372oracloseapproximationathttp://www.open-std. org/jtc1/sc22/wg21/docs/papers/2012/n3376.pdf.
12. C. Lameter. Effective synchronization on Linux/NUMA systems. Proceedings of the May 2005 Gelato Federation Meeting (http://www.lameter.com/gelato2005. pdf), 2005.
13. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9):690-691, 1979. (Pubitemid 10420526)
14. D. Lea. jsr166e: Class SequenceLock. http://gee.cs.oswego.edu/dl/jsr166/ dist/jsr166edocs/jsr166e/SequenceLock.html retrieved Mar. 8, 2012.
15. D. Marino, A. Singh, T. Millstein, M. Musuvathi, and S. Narayanasami. A case for an sc-preserving compiler. In PLDI, 2011.
16. 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.
17. T. Nkaike and M. Michael. Lock elision for read-only critical sections in java. In PLDI, 2010.
18. J. Sevcik. Program Transformations in Weak Memory Models. PhD thesis, University of Edinburgh, 2008.
19. J. Sevcik and D. Aspinall. On validity of program transformations in the java memory model. In ECOOP 2008, pages 27-51, 2008.
20. J. Sevcik and P. Sewell. C/C++11 mappings to processors. http://www.cl.cam.ac.uk/~pes20/cpp/cpp0xmappings.html"retrieved Mar. 3, 2012, 2011.
21. P. Sewell, S. Sarkar, S. Owens, F. Z. Nardelli, and M. O. Myreen. x86-tso: A rigorous and usable programmer's model for x86 multiprocesors. Communications of the ACM, 53(7):89-97, July 2010.