메뉴 건너뛰기




Volumn , Issue , 2010, Pages 295-306

Efficient sequential consistency using conditional fences

Author keywords

active table; associates; conditional fences; interprocessor delay; memory consistency; sequential consistency

Indexed keywords

C (PROGRAMMING LANGUAGE); FENCES; MEMORY ARCHITECTURE; PARALLEL ARCHITECTURES;

EID: 78149267285     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1854273.1854312     Document Type: Conference Paper
Times cited : (31)

References (27)
  • 1
    • 0030382365 scopus 로고
    • Shared memory consistency models: A tutorial
    • S. V. Adve and K. Gharachorloo. Shared memory consistency models: A tutorial. IEEE Computer, 29:66-76, 1995.
    • (1995) IEEE Computer , vol.29 , pp. 66-76
    • Adve, S.V.1    Gharachorloo, K.2
  • 2
    • 76749165809 scopus 로고    scopus 로고
    • BulkCompiler: High-performance sequential consistency through cooperative compiler and hardware support
    • New York, NY, USA, ACM
    • W. Ahn, S. Qi, M. Nicolaides, J. Torrellas, J.-W. Lee, X. Fang, S. Midkiff, and D. Wong. BulkCompiler: high-performance sequential consistency through cooperative compiler and hardware support. In Proceedings of MICRO-42, pages 133-144, New York, NY, USA, 2009. ACM.
    • (2009) Proceedings of MICRO-42 , pp. 133-144
    • Ahn, W.1    Qi, S.2    Nicolaides, M.3    Torrellas, J.4    Lee, J.-W.5    Fang, X.6    Midkiff, S.7    Wong, D.8
  • 3
    • 70450248788 scopus 로고    scopus 로고
    • Invisifence: Performance-transparent memory ordering in conventional multiprocessors
    • New York, NY, USA, ACM
    • C. Blundell, M. M. Martin, and T. F. Wenisch. Invisifence: performance-transparent memory ordering in conventional multiprocessors. In Proceedings of ISCA-36, pages 233-244, New York, NY, USA, 2009. ACM.
    • (2009) Proceedings of ISCA-36 , pp. 233-244
    • Blundell, C.1    Martin, M.M.2    Wenisch, T.F.3
  • 6
    • 78149258204 scopus 로고    scopus 로고
    • Polynomial-time algorithms for enforcing sequential consistency in SPMD programs with arrays
    • Springer-Verlag
    • W.-Y. Chen, A. Krishnamurthy, and K. Yelick. Polynomial-time algorithms for enforcing sequential consistency in SPMD programs with arrays. In LCPC, pages 2-4. Springer-Verlag, 2003.
    • (2003) LCPC , pp. 2-4
    • Chen, W.-Y.1    Krishnamurthy, A.2    Yelick, K.3
  • 12
    • 0032653015 scopus 로고    scopus 로고
    • Is SC + ILP = RC?
    • Washington, DC, USA, IEEE Computer Society
    • C. Gniady, B. Falsafi, and T. N. Vijaykumar. Is SC + ILP = RC? In Proceedings of ISCA-26, pages 162-171, Washington, DC, USA, 1999. IEEE Computer Society.
    • (1999) Proceedings of ISCA-26 , pp. 162-171
    • Gniady, C.1    Falsafi, B.2    Vijaykumar, T.N.3
  • 17
    • 0018518477 scopus 로고
    • How to make a multiprocessor computer that correctly executes multiprocess progranm
    • L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess progranm. IEEE Trans. Comput., 28(9):690-691, 1979.
    • (1979) IEEE Trans. Comput. , vol.28 , Issue.9 , pp. 690-691
    • Lamport, L.1
  • 18
    • 0035416088 scopus 로고    scopus 로고
    • Hiding relaxed memory consistency with a compiler
    • J. Lee and D. A. Padua. Hiding relaxed memory consistency with a compiler. IEEE Trans. Comput., 50(8):824-833, 2001.
    • (2001) IEEE Trans. Comput. , vol.50 , Issue.8 , pp. 824-833
    • Lee, J.1    Padua, D.A.2
  • 20
    • 84955612890 scopus 로고
    • Dependence analysis in parallel loops with i±k subscripts
    • S. P. Midkiff. Dependence analysis in parallel loops with i±k subscripts. In LCPC, pages 331-345, 1995.
    • (1995) LCPC , pp. 331-345
    • Midkiff, S.P.1
  • 24
    • 0023994389 scopus 로고
    • Efficient and correct execution of parallel programs that share memory
    • D. Shasha and M. 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
  • 26
    • 35348832285 scopus 로고    scopus 로고
    • Mechanisms for store-wait-free multiprocessors
    • New York, NY, USA, ACM
    • T. F. Wenisch, A. Ailamaki, B. Falsafi, and A. Moshovos. Mechanisms for store-wait-free multiprocessors. In Proceedings of ISCA-34, pages 266-277, New York, NY, USA, 2007. ACM.
    • (2007) Proceedings of ISCA-34 , pp. 266-277
    • Wenisch, T.F.1    Ailamaki, A.2    Falsafi, B.3    Moshovos, A.4
  • 27
    • 0029179077 scopus 로고
    • The SPLASH-2 programs: Characterization and methodological considerations
    • New York, NY, USA, ACM
    • S. C. Woo, M. Ohara, E. Torrie, J. P. Singh, and A. Gupta. The SPLASH-2 programs: characterization and methodological considerations. In Proceedings of ISCA-22, pages 24-36, New York, NY, USA, 1995. ACM.
    • (1995) Proceedings of ISCA-22 , pp. 24-36
    • Woo, S.C.1    Ohara, M.2    Torrie, E.3    Singh, J.P.4    Gupta, A.5


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