메뉴 건너뛰기




Volumn , Issue , 2011, Pages 306-316

Safe optimisations for shared-memory concurrent programs

Author keywords

compiler optimizations; relaxed memory models; semantics

Indexed keywords

C++ (PROGRAMMING LANGUAGE); MEMORY ARCHITECTURE; PROGRAM COMPILERS;

EID: 79959909081     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993498.1993534     Document Type: Conference Paper
Times cited : (49)

References (26)
  • 1
    • 0025433676 scopus 로고
    • Weak ordering - A new definition
    • S. V. Adve and M. D. Hill. Weak ordering - a new definition. In ISCA'90, pages 2-14, 1990.
    • (1990) ISCA'90 , pp. 2-14
    • Adve, S.V.1    Hill, M.D.2
  • 2
    • 0030382365 scopus 로고    scopus 로고
    • Shared memory consistency models: A tutorial
    • Sarita V. Adve and Kourosh Gharachorloo. Shared memory consistency models: A tutorial. Computer, 29(12):66-76, 1996.
    • (1996) Computer , vol.29 , Issue.12 , pp. 66-76
    • Adve, S.V.1    Gharachorloo, K.2
  • 6
    • 67650088518 scopus 로고    scopus 로고
    • Foundations of the C++ concurrency memory model
    • New York, NY, USA, ACM
    • Hans-J. Boehm and Sarita V. Adve. Foundations of the C++ concurrency memory model. In PLDI '08, pages 68-78, New York, NY, USA, 2008. ACM.
    • (2008) PLDI '08 , pp. 68-78
    • Boehm, H.-J.1    Adve, S.V.2
  • 7
    • 67649837188 scopus 로고    scopus 로고
    • Relaxed memory models: An operational approach
    • Gérard Boudol and Gustavo Petri. Relaxed memory models: an operational approach. In POPL '09, pages 392-403, 2009.
    • (2009) POPL '09 , pp. 392-403
    • Boudol, G.1    Petri, G.2
  • 8
    • 77951568206 scopus 로고    scopus 로고
    • Verifying local transformations on relaxed memory models
    • S. Burckhardt, M. Musuvathi, and V. Singh. Verifying local transformations on relaxed memory models. In CC '10, pages 104-123, 2010.
    • (2010) CC '10 , pp. 104-123
    • Burckhardt, S.1    Musuvathi, M.2    Singh, V.3
  • 9
    • 79953116512 scopus 로고    scopus 로고
    • The Java memory model: Operationally, denotationally, axiomatically
    • P. Cenciarelli, A. Knapp, and E. Sibilio. The Java memory model: Operationally, denotationally, axiomatically. In 16th ESOP, 2007.
    • 16th ESOP, 2007
    • Cenciarelli, P.1    Knapp, A.2    Sibilio, E.3
  • 13
    • 0017996760 scopus 로고
    • TIME, CLOCKS, and the ORDERING of EVENTS in A DISTRIBUTED SYSTEM
    • DOI 10.1145/359545.359563
    • Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7):558-565, 1978. (Pubitemid 8615486)
    • (1978) Communications of the ACM , vol.21 , Issue.7 , pp. 558-565
    • Lamport, L.1
  • 15
    • 18844394830 scopus 로고    scopus 로고
    • Basic compiler algorithms for parallel programs
    • ACM
    • Jaejin Lee, David A. Padua, and Samuel P. Midkiff. Basic compiler algorithms for parallel programs. In PPOPP, pages 1-12. ACM, 1999.
    • (1999) PPOPP , pp. 1-12
    • Lee, J.1    Padua, D.A.2    Midkiff, S.P.3
  • 16
    • 17044378871 scopus 로고    scopus 로고
    • The Java memory model
    • New York, NY, USA, ACM Press
    • J. Manson, W. Pugh, and S. Adve. The Java memory model. In POPL '05, pages 378-391, New York, NY, USA, 2005. ACM Press.
    • (2005) POPL '05 , pp. 378-391
    • Manson, J.1    Pugh, W.2    Adve, S.3
  • 17
    • 0003451206 scopus 로고
    • Issues in the optimization of parallel programs
    • Pennsylvania State University Press
    • Samuel P. Midkiff and David A. Padua. Issues in the optimization of parallel programs. In ICPP (2), pages 105-113. Pennsylvania State University Press, 1990.
    • (1990) ICPP , Issue.2 , pp. 105-113
    • Midkiff, S.P.1    Padua, D.A.2
  • 18
    • 48949084652 scopus 로고    scopus 로고
    • Understand the impact of low-lock techniques in multithreaded apps
    • Oct
    • Vance Morrison. Understand the impact of low-lock techniques in multithreaded apps. MSDN Magazine, Oct 2005.
    • (2005) MSDN Magazine
    • Morrison, V.1
  • 21
    • 77951293741 scopus 로고    scopus 로고
    • PhD thesis, University of Edinburgh, Laboratory for Foundations of Computer Science
    • J. Ševčík. Program Transformations in Weak Memory Models. PhD thesis, University of Edinburgh, Laboratory for Foundations of Computer Science, 2008.
    • (2008) Program Transformations in Weak Memory Models
    • Ševčík, J.1
  • 23
    • 49049109657 scopus 로고    scopus 로고
    • On validity of program transformations in the Java memory model
    • J. Ševčík and D. Aspinall. On validity of program transformations in the Java memory model. In ECOOP '08, pages 27-51, 2008.
    • (2008) ECOOP '08 , pp. 27-51
    • Ševčík, J.1    Aspinall, D.2
  • 24
    • 0023994389 scopus 로고
    • Efficient and correct execution of parallel programs that share memory
    • Dennis Shasha and Marc Snir. Efficient and correct execution of parallel programs that share memory. ACM Trans. Program. Lang. Syst., 10(2):282-312, 1988.
    • (1988) ACM Trans. Program. Lang. Syst. , vol.10 , Issue.2 , pp. 282-312
    • Shasha, D.1    Snir, M.2
  • 25
    • 33749137885 scopus 로고    scopus 로고
    • Sparc International version 9 Available from
    • Sparc International. Sparc architecture manual, version 9, 2000. Available from http://developers.sun.com/solaris/articles/sparcv9.html.
    • (2000) Sparc Architecture Manual
  • 26
    • 31844442862 scopus 로고    scopus 로고
    • Compiler techniques for high performance sequentially consistent Java programs
    • New York, NY, USA, ACM
    • Z. Sura, X. Fang, C. Wong, S. Midkiff, J. Lee, and D. Padua. Compiler techniques for high performance sequentially consistent Java programs. In PPoPP '05, pages 2-13, New York, NY, USA, 2005. ACM.
    • (2005) PPoPP '05 , pp. 2-13
    • Sura, Z.1    Fang, X.2    Wong, C.3    Midkiff, S.4    Lee, J.5    Padua, D.6


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.