Synchronising C/C++ and power

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2012, Pages 311-321

  Sarkar, Susmit ^a   Memarian, Kayvan ^a   Owens, Scott ^a   Batty, Mark ^a   Sewell, Peter ^a   Maranget, Luc ^b   Alglave, Jade ^c   Williams, Derek ^d  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b INRIA   (France)

^c UNIVERSITY OF OXFORD   (United Kingdom)

^d IBM   (United States)

Author keywords

Relaxed memory models; Semantics

Indexed keywords

ATOMIC OPERATION; CONCURRENT ALGORITHMS; EXTENSIVE TESTING; MUTEXES; RELAXED MEMORY MODELS; SHARED MEMORIES; SPINLOCK;

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; SEMANTICS;

SYNCHRONIZATION;

EID: 84863424307     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2254064.2254102     Document Type: Conference Paper

References (24)

1. S. V. Adve and M. D. Hill. Weak ordering-a new definition. In Proc. ISCA, 1990.
2. J. Alglave and L. Maranget. Stability in weak memory models. In Proc. CAV, 2011.
3. J. Alglave, L. Maranget, S. Sarkar, and P. Sewell. Fences in weak memory models. In Proc. CAV, 2010.
4. H.-J. Boehm and S.V. Adve. Foundations of the C++ concurrency memory model. In Proc. PLDI, 2008.
5. P. Becker, editor. Programming Languages - C++. 2011. ISO/IEC 14882:2011. A non-final but recent version is available at http://www.open-std.org/jtc1/ sc22/wg21/docs/papers/2011/n3242.pdf.
6. M. Batty, K. Memarian, S. Owens, S. Sarkar, and P. Sewell. Clarifying and compiling C/C++ concurrency: from C++11 to POWER. In Proc. POPL, 2012. http://www.cl.cam.ac.uk/~pes20/cppppc/.
7. H.-J. Boehm. Threads cannot be implemented as a library. In Proc. PLDI, 2005.
8. M. Batty, S. Owens, S. Sarkar, P. Sewell, and T.Weber. Mathematizing C++ concurrency. In Proc. POPL, 2011.
9. Supplementary material. http://www.cl.cam.ac.uk/users/pes20/cppppc- supplemental.
10. F. Corella, J. M. Stone, and C. M. Barton. A formal specification of the PowerPC shared memory architecture. Technical Report RC18638, IBM, 1993.
11. M. Herlihy. A methodology for implementing highly concurrent data objects. TOPLAS, 15(5):745-770, Nov 1993.
12. Intel. A formal specification of Intel Itanium processor family memory ordering. http://www.intel.com/design/itanium/downloads/251429.htm, October 2002.
13. Programming Languages - C. 2011. ISO/IEC 9899:2011. A non-final but recent version is available at http://www.open-std.org/jtc1/sc22/wg14/docs/ n1539.pdf.
14. E. H. Jensen, G. W. Hagensen, and J. M. Broughton. A new approach to exclusive data access in shared memory multiprocessors. (Technical Report UCRL-97663), Nov 1987.
15. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput., C-28(9):690-691, 1979. (Pubitemid 10420526)
16. P. E. McKenney. [patch rfc tip/core/rcu 0/28] preview of rcu changes for 3.3, November 2011. https://lkml.org/lkml/2011/11/2/363.
17. M. M. Michael. Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Trans. Parallel Distrib. Syst., 15:491-504, June 2004.
18. P. E. McKenney and R. Silvera. Example POWER implementation for C/C++ memory model. http://www.rdrop.com/users/paulmck/scalability/paper/N2745r.2011. 03.04a.html, 2011.
19. S. Owens, P. Böhm, F. Zappa Nardelli, and P. Sewell. Lem: A lightweight tool for heavyweight semantics. In Proc. ITP, LNCS 6898, 2011. "Rough Diamond" section.
20. M. Parkinson, R. Bornat, and P. O'Hearn. Modular verification of a non-blocking stack. In Proc. POPL, 2007.
21. Power ISA Version 2.06. IBM, 2009.
22. J. Ševčík . Safe optimisations for shared-memory concurrent programs. In Proc. PLDI, 2011.
23. D. Shasha and M. Snir. Efficient and correct execution of parallel programs that share memory. TOPLAS, 10:282-312, 1988. (Pubitemid 18638207)
24. S. Sarkar, P. Sewell, J. Alglave, L. Maranget, and D.Williams. Understanding POWER multiprocessors. In PLDI, 2011.