Efficient sequential consistency via conflict ordering

International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS

Volumn , Issue , 2012, Pages 273-285

  Lin, Changhui ^a   Nagarajan, Vijay ^b   Gupta, Rajiv ^a   Rajaram, Bharghava ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

conflict ordering; sequential consistency

Indexed keywords

CONFLICT ORDERING; HARDWARE COST; MEMORY CONSISTENCY MODELS; MEMORY OPERATIONS; MEMORY ORDERING; PROCESSOR DESIGNERS; PROGRAM ORDER; RELAXED MEMORY MODELS; SEQUENTIAL CONSISTENCY;

PROGRAM PROCESSORS;

EID: 84863364353     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2150976.2151006     Document Type: Conference Paper

References (33)

1. Intel Single-Chip Cloud Computer. http://techresearch.intel.com/articles/ Tera-Scale/1826.htm.
2. Telera Tile-Gx processor. http://www.tilera.com/products/processors.
3. 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, 2010.
4. S. V. Adve and K. Gharachorloo. Shared memory consistency models: A tutorial. IEEE Computer, 29:66-76, 1995. (Pubitemid 126517873)
5. 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.
6. C. Blundell, M. M. Martin, and T. F. Wenisch. InvisiFence: performance-transparent memory ordering in conventional multiprocessors. In Proceedings of the 36th Annual International Symposium on Computer Architecture, ISCA '09, pages 233-244, 2009.
7. L. Ceze, J. Tuck, P. Montesinos, and J. Torrellas. BulkSC: bulk enforcement of sequential consistency. In Proceedings of the 34th Annual International Symposium on Computer Architecture, ISCA '07, pages 278-289, 2007.
8. H. Chafi, J. Casper, B. D. Carlstrom, A. McDonald, C. C. Minh, W. Baek, C. Kozyrakis, and K. Olukotun. A scalable, non-blocking approach to transactional memory. In Proceedings of the IEEE 13th International Symposium on High Performance Computer Architecture, HPCA '07, pages 97-108, 2007.
9. T. Elmas, S. Qadeer, and S. Tasiran. Goldilocks: a race and transaction-aware java runtime. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '07, pages 245-255, 2007.
10. X. Fang, J. Lee, and S. P. Midkiff. Automatic fence insertion for shared memory multiprocessing. In Proceedings of the 17th Annual International Conference on Supercomputing, ICS '03, pages 285-294, 2003.
11. M. Galluzzi, E. Vallejo, A. Cristal, F. Vallejo, R. Beivide, P. Stenström, J. E. Smith, and M. Valero. Implicit transactional memory in kiloinstruction multiprocessors. In Asia-Pacific Computer Systems Architecture Conference, pages 339-353, 2007.
12. K. Gharachorloo, A. Gupta, and J. Hennessy. Two techniques to enhance the performance of memory consistency models. In Proceedings of the International Conference on Parallel Processing, ISCA '91, pages 355-364, 1991.
13. C. Gniady and B. Falsafi. Speculative sequential consistency with little custom storage. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, PACT '02, pages 179-188, 2002.
14. C. Gniady, B. Falsafi, and T. N. Vijaykumar. Is SC + ILP = RC? In Proceedings of the 26th Annual International Symposium on Computer Architecture, ISCA '99, pages 162-171, 1999.
15. L. Hammond, V. Wong, M. 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 Proceedings of the 31st Annual International Symposium on Computer Architecture, ISCA '04, page 102, 2004.
16. M. D. Hill. Multiprocessors should support simple memory-consistency models. Computer, 31(8):28-34, 1998.
17. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess program. IEEE Transactions on Computers, 28(9):690-691, 1979. (Pubitemid 10420526)
18. J. Lee and D. A. Padua. Hiding relaxed memory consistency with a compiler. IEEE Transactions on Computers, 50(8):824-833, 2001. (Pubitemid 32922844)
19. C. Lin, V. Nagarajan, and R. Gupta. Efficient sequential consistency using conditional fences. In Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques, PACT '10, pages 295-306, 2010.
20. B. Lucia, L. Ceze, K. Strauss, S. Qadeer, and H.-J. Boehm. Conflict exceptions: simplifying concurrent language semantics with precise hardware exceptions for data-races. In Proceedings of the 37th Annual International Symposium on Computer Architecture, ISCA '10, pages 210-221, 2010.
21. D. Marino, A. Singh, T. Millstein, M. Musuvathi, and S. Narayanasamy. DRFx: a simple and efficient memory model for concurrent programming languages. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '10, pages 351-362, 2010.
22. D. Marino, A. Singh, T. Millstein, M. Musuvathi, and S. Narayanasamy. A case for an SC-preserving compiler. In Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '11, pages 199-210, 2011.
23. P. Ranganathan, V. S. Pai, and S. V. Adve. Using speculative retirement and larger instruction windows to narrow the performance gap between memory consistency models. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '97, pages 199-210, 1997.
24. J. Renau, B. Fraguela, J. Tuck, W. Liu, M. Prvulovic, L. Ceze, S. Sarangi, P. Sack, K. Strauss, and P. Montesinos. SESC simulator, January 2005. http://sesc.sourceforge.net.
25. K. G. Sarita, S. V. Adve, A. Gupta, J. L. Hennessy, and M. D. Hill. Specifying system requirements for memory consistency models. Technical Report CSL-TR-93-594, Stanford University, 1993.
26. C. Scheurich and M. Dubois. Correct memory operation of cache-based multiprocessors. In Proceedings of the 14th Annual International Symposium on Computer Architecture, ISCA '87, pages 234-243, 1987.
27. K. Sen. Race directed random testing of concurrent programs. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '08, pages 11-21, 2008.
28. P. Sewell, S. Sarkar, S. Owens, F. Z. Nardelli, and M. O. Myreen. x86-TSO: a rigorous and usable programmer's model for x86 multiprocessors. Communication of the ACM, 53(7):89-97, 2010.
29. 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, 1988. (Pubitemid 18638207)
30. A. Singh, D. Marino, S. Narayanasamy, T. Millstein, and M. Musuvathi. Efficient processor support for DRFx, a memory model with exceptions. In Proceedings of the 16th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS '11, pages 53-66, 2011.
31. T. F.Wenisch, A. Ailamaki, B. Falsafi, and A. Moshovos. Mechanisms for store-wait-free multiprocessors. In Proceedings of the 34th Annual International Symposium on Computer Architecture, ISCA '07, pages 266-277, 2007.
32. S. C. Woo, M. Ohara, E. Torrie, J. P. Singh, and A. Gupta. The SPLASH-2 programs: characterization and methodological considerations. In Proceedings of the 22nd Annual International Symposium on Computer Architecture, ISCA '95, pages 24-36, 1995.
33. K. C. Yeager. The MIPS R10000 superscalar microprocessor. IEEE Micro, 16(2):28-40, 1996.