DRFx: A simple and efficient memory model for concurrent programming languages

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

Volumn , Issue , 2010, Pages 351-362

  Marino, Daniel ^a   Singh, Abhayendra ^b   Millstein, Todd ^a   Musuvathi, Madanlal ^c   Narayanasamy, Satish ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

data races; memory model exception; memory models; sequential consistency; soft fences

Indexed keywords

COMPILER OPTIMIZATIONS; COMPILER WRITERS; CONCURRENT PROGRAMMING LANGUAGES; CONFLICT DETECTION; DATA RACES; EFFICIENT MEMORY MODELS; HARDWARE DESIGN; HARDWARE OPTIMIZATION; JAVA MEMORY MODEL; MEMORY MODELS; MULTITHREADED PROGRAMMING; SAFETY ISSUES; SEQUENTIAL CONSISTENCY; SHARED MEMORIES;

C (PROGRAMMING LANGUAGE); COMPUTER PROGRAMMING; COMPUTER SOFTWARE; DESIGN; FENCES; HARDWARE; JAVA PROGRAMMING LANGUAGE; LINGUISTICS; QUERY LANGUAGES; SEMANTICS;

PROGRAM COMPILERS;

EID: 77954749619     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806596.1806636     Document Type: Conference Paper

References (38)

1. S. V. Adve and M. D. Hill. Weak ordering - a new definition. In Proceedings of ISCA, pages 2-14. ACM, 1990.
2. S. V. Adve, M. D. Hill, B. P. Miller, and R. H. B. Netzer. Detecting data races on weak memory systems. In ISCA, pages 234-243, 1991.
3. W. Ahn, S. Qi, J.-W. Lee, M. Nicolaides, X. Fang, J. Torrellas, D. Wong, and S. Midkiff. Bulkcompiler: High-performance sequential consistency through cooperative compiler and hardware support. In 42nd International Symposium on Microarchitecture, 2009.
4. C. Bienia, S. Kumar, J. P. Singh, and K. Li. The parsec benchmark suite: Characterization and architectural implications. In Proceedings of the 17th International Conference on Parallel Architectures and Compilation Techniques, October 2008.
5. C. Blundell, M. Martin, and T. Wenisch. Invisifence: performance- transparent memory ordering in conventional multiprocessors. In ISCA, 2009.
6. H. J. Boehm. Simple thread semantics require race detection. In FIT session at PLDI, 2009.
7. H. J. Boehm and S. Adve. Foundations of the c++ concurrency memory model. In Proceedings of PLDI, pages 68-78. ACM, 2008.
8. C. Boyapati and M. Rinard. A parameterized type system for race-free Java programs. In Proceedings of OOPSLA, pages 56-69. ACM Press, 2001.
9. C. Boyapati, R. Lee, and M. Rinard. Ownership types for safe programming: Preventing data races and deadlocks. In Proceedings of OOPSLA, 2002.
10. P. Cenciarelli, A. Knapp, and E. Sibilio. The java memory model: Operationally, denotationally, axiomatically. In ESOP, pages 331-346, 2007.
11. L. Ceze, J. Tuck, P. Montesinos, and J. Torrellas. Bulksc: bulk enforcement of sequential consistency. In ISCA, pages 278-289, 2007.
12. L. Ceze, J. Devietti, B. Lucia, and S. Qadeer. The case for system support for concurrency exceptions. In USENIX HotPar, 2009.
13. D. Dice, Y. Lev, M. Moir, and D. Nussbaum. Early experience with a commercial hardware transactional memory implementation. In Proceedings of ASPLOS, 2009.
14. C. Flanagan and S. Freund. FastTrack: efficient and precise dynamic race detection. In Proceedings of PLDI, 2009.
15. C. Flanagan and S. N. Freund. Type-based race detection for Java. In Proceedings of PLDI, pages 219-232, 2000.
16. K. Gharachorloo and P. Gibbons. Detecting violations of sequential consistency. In Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, pages 316-326. ACM New York, NY, USA, 1991.
17. K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. Hennessy. Memory consistency and event ordering in scalable shared-memory multiprocessors. In Proceedings of ISCA, pages 15-26, 1990.
18. L. Hammond, V. Wong, M. K. Chen, B. D. Carlstrom, J. D. Davis, B. Hertzberg, M. K. Prabhu, H. Wijaya, C. Kozyrakis, and K. Olukotun. Transactional memory coherence and consistency. In ISCA, pages 102-113, 2004.
19. M. Herlihy and J. E. B. Moss. Transactional memory: architectural support for lock-free data structures. In Proceedings of ISCA, pages 289-300. ACM, 1993.
20. A. Kamil, J. Su, and K. Yelick. Making sequential consistency practical in Titanium. In Proceedings of the 2005 ACM/IEEE conference on Supercomputing, page 15. IEEE Computer Society, 2005.
21. A. Krishnamurthy and K. Yelick. Analyses and optimizations for shared address space programs. Journal of Parallel and Distributed Computing, 38(2):130-144, 1996. (Pubitemid 126165888)
22. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-565, 1978.
23. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE transactions on computers, 100(28):690-691, 1979.
24. C. Lattner and V. Adve. LLVM: A compilation framework for lifelong program analysis & transformation. In Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization. IEEE Computer Society, 2004.
25. B. Liblit, A. Aiken, and K. Yelick. Type systems for distributed data sharing. In Proceedings of the Tenth International Static Analysis Symposium, 2003.
26. B. Lucia, L. Ceze, K. Strauss, S. Qadeer, and H. Boehm. Conflict exceptions: Providing simple parallel language semantics with precise hardware exceptions. In 37th Annual International Symposium on Computer Architecture, June 2010.
27. C. K. Luk, R. Cohn, R.Muth, H. Patil, A. Klauser, G. Lowney, S.Wallace, V. J. Reddi, and K. Hazelwood. Pin: Building customized program analysis tools with dynamic instrumentation. In Programming Language Design and Implementation, Chicago, IL, June 2005.
28. J. Manson, W. Pugh, and S. Adve. The java memory model. In Proceedings of POPL, pages 378-391. ACM, 2005.
29. D. Marino, A. Singh, T. Millstein, M. Musuvathi, and S. Narayanasamy. DRFx: A simple and efficient memory model for concurrent programming languages. Technical Report 090021, UCLA Computer Science Department, Nov. 2009. URL http://fmdb.cs.ucla.edu/Treports/090021.pdf.
30. A. Muzahid, D. Suarez, S. Qi, and J. Torrellas. Sigrace: signature-based data race detection. In ISCA, 2009.
31. P. Pratikakis, J. S. Foster, and M. Hicks. Locksmith: context-sensitive correlation analysis for race detection. In Proceedings of PLDI, pages 320-331, 2006.
32. M. Prvulovic and J. Torrelas. Reenact: Using thread-level speculation mechanisms to debug data races in multithreaded codes. In Proceedings of ISCA, San Diego, CA, June 2003.
33. P. Ranganathan, V. Pai, and S. Adve. Using speculative retirement and larger instruction windows to narrow the performance gap between memory consistency models. In Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, pages 199-210, 1997.
34. S. Sethumadhavan, R. Desikan, D. Burger, C. Moore, and S. Keckler. Scalable hardware memory disambiguation for high ILP processors. In Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture. IEEE Computer Society, 2003.
35. J. Sevcík and D. Aspinall. On validity of program transformations in the java memory model. In ECOOP, pages 27-51, 2008.
36. D. Shasha and M. Snir. Efficient and correct execution of parallel programs that share memory. ACM Transactions on Programming Languages and Systems (TOPLAS), 10(2):282-312, 1988.
37. Z. Sura, X. Fang, C. Wong, S. Midkiff, J. Lee, and D. Padua. Compiler techniques for high performance sequentially consistent java programs. In Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 2-13, 2005.
38. W. Triebel, J. Bissell, and R. Booth. Programming Itanium-based Systems. Intel Press, 2001.