메뉴 건너뛰기




Volumn 16, Issue 7, 2005, Pages 663-671

The complexity of verifying memory coherence and consistency

Author keywords

Design styles; Error checking; Fault tolerance; Hardware; Memory structures; Nonnumerical algorithms and problems; Reliability; Sequencing and scheduling; Shared memory; Testing; Theory of computation

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; DATA STORAGE EQUIPMENT; ERROR ANALYSIS; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; RELIABILITY; TESTING;

EID: 22944480517     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2005.86     Document Type: Article
Times cited : (27)

References (22)
  • 2
    • 22944467049 scopus 로고    scopus 로고
    • "Reliability, Availability, Serviceability (RAS)"
    • The IBM e-server pSeries 690, technical white paper, IBM, Sept
    • The IBM e-server pSeries 690, "Reliability, Availability, Serviceability (RAS)," technical white paper, IBM, Sept. 2001.
    • (2001)
  • 5
    • 0031211417 scopus 로고    scopus 로고
    • "Testing Shared Memories"
    • Aug
    • P. Gibbons and E. Korach, "Testing Shared Memories," SIAM J. Computing, pp. 1208-1244, Aug. 1997.
    • (1997) SIAM J. Computing , pp. 1208-1244
    • Gibbons, P.1    Korach, E.2
  • 6
    • 0037661666 scopus 로고
    • "New Results on the Complexity of Sequential Consistency"
    • technical report, AT&T Bell Laboratories, Murray Hill, N.J., Sept
    • P. Gibbons and E. Korach, "New Results on the Complexity of Sequential Consistency," technical report, AT&T Bell Laboratories, Murray Hill, N.J., Sept. 1993.
    • (1993)
    • Gibbons, P.1    Korach, E.2
  • 7
    • 1242285021 scopus 로고    scopus 로고
    • "Complexity of Verifying Java Shared Memory Execution"
    • World Scientific Publishing Company
    • A. Gontmakher, S. Polyakov, and A. Schuster, "Complexity of Verifying Java Shared Memory Execution," Parallel Processing Letters, World Scientific Publishing Company, 2003.
    • (2003) Parallel Processing Letters
    • Gontmakher, A.1    Polyakov, S.2    Schuster, A.3
  • 11
    • 0141831838 scopus 로고    scopus 로고
    • "Verifying Sequential Consistency on Shared-Memory Multiprocessors by Model-Checking"
    • Aug
    • S. Qadeer, "Verifying Sequential Consistency on Shared-Memory Multiprocessors by Model-Checking," IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 8, Aug. 2003.
    • (2003) IEEE Trans. Parallel and Distributed Systems , vol.14 , Issue.8
    • Qadeer, S.1
  • 13
    • 0020736536 scopus 로고
    • "Complexity of Analyzing the Synchronization Structure of Concurrent Programs"
    • R. Taylor, "Complexity of Analyzing the Synchronization Structure of Concurrent Programs," Acta Informatica 19, pp. 57-84, 1983.
    • (1983) Acta Informatica , vol.19 , pp. 57-84
    • Taylor, R.1
  • 15
    • 0018518477 scopus 로고
    • "How to Make a Multiprocessor Computer that Correctly Executes Multiprocess Programs"
    • Sept
    • L. Lamport, "How to Make a Multiprocessor Computer that Correctly Executes Multiprocess Programs," IEEE Trans. Computers, vol. 28, no. 9, pp. 690-691, Sept. 1979.
    • (1979) IEEE Trans. Computers , vol.28 , Issue.9 , pp. 690-691
    • Lamport, L.1
  • 16
    • 22944492602 scopus 로고    scopus 로고
    • SPARC International, Inc
    • SPARC International, Inc., http://www.sparc.org, 2005.
    • (2005)
  • 17
    • 22944483321 scopus 로고    scopus 로고
    • Intel Corporation
    • Intel Corporation, http://www.intel.com, 2005.
    • (2005)
  • 19
    • 22944454391 scopus 로고    scopus 로고
    • "Commit-Reconcile & Fences (CRF): A New Memory Model for Architects and Compiler Writers"
    • X. Shen, Arvind, and L. Rudolph, "Commit-Reconcile & Fences (CRF): A New Memory Model for Architects and Compiler Writers," Proc Int'l Symp. Computer Architecture, 2000.
    • (2000) Proc Int'l Symp. Computer Architecture
    • Arvind, X.S.1    Rudolph, L.2
  • 20
    • 0003512886 scopus 로고
    • "Memory Consistency Models for Shared-Memory Multiprocessors"
    • WRL Research Report 95/9
    • K. Gharachorloo, "Memory Consistency Models for Shared-Memory Multiprocessors," WRL Research Report 95/9, 1995.
    • (1995)
    • Gharachorloo, K.1
  • 22
    • 0037661667 scopus 로고    scopus 로고
    • "The Complexity of Verifying Memory Coherence"
    • Technical, Report ECE-03-01, Univ. of Wisconsin-Madison
    • J. Cantin, "The Complexity of Verifying Memory Coherence," Technical, Report ECE-03-01, Univ. of Wisconsin-Madison, 2003.
    • (2003)
    • Cantin, J.1


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