메뉴 건너뛰기




Volumn , Issue , 2009, Pages 25-34

Detecting and eliminating potential violation of sequential consistency for concurrent C/C++ programs

Author keywords

Data race detection; Delay set; Fence; Relaxed memory model; Sequential consistency

Indexed keywords

ADDITIONAL COSTS; CONCURRENT PROGRAM; CONFLICT GRAPH; CYCLE DETECTION; DATA RACE DETECTION; DELAY SET; MULTITHREADED; PERFORMANCE LOSS; RACE DETECTION; REAL-WORLD APPLICATION; RELAXED MEMORY MODEL; SEQUENTIAL CONSISTENCY; SHARED-MEMORY PROGRAMS; SOURCE CODES;

EID: 67650518203     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CGO.2009.29     Document Type: Conference Paper
Times cited : (15)

References (40)
  • 1
    • 0023994389 scopus 로고
    • Efficient and correct execution of parallel programs that share memory
    • D.Shasha, 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
  • 20
    • 33748872472 scopus 로고    scopus 로고
    • CORD: Cost-effective (and nearly overhead-free) Order- Recording and Data race detection
    • M.Prvulovic, CORD: Cost-effective (and nearly overhead-free) Order- Recording and Data race detection. In High Performance Computer Architecture, 2006.
    • (2006) High Performance Computer Architecture
    • Prvulovic, M.1
  • 27
    • 0018518477 scopus 로고
    • How to make a multiprocessor computer that correctly executes multiprocess programs
    • L.Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. In IEEE Tran. On Computer, 1979.
    • (1979) IEEE Tran. on Computer
    • Lamport, L.1
  • 28
    • 67650525989 scopus 로고
    • Shared Memory Consistency Models: A tutorial
    • S.V.Adve, K.Gharachorloo, Shared Memory Consistency Models: A tutorial. In IEEE computer, 1995.
    • (1995) IEEE Computer
    • Adve, S.V.1    Gharachorloo, K.2
  • 33
    • 67650555312 scopus 로고    scopus 로고
    • Double-checked-locking: An optimization pattern for efficiently initializing and accessing thread-safe objects
    • D.Schmidt, T.Harrison. Double-checked-locking: an optimization pattern for efficiently initializing and accessing thread-safe objects. In Programming Language Design and Implementation, 1996.
    • (1996) Programming Language Design and Implementation
    • Schmidt, D.1    Harrison, T.2
  • 40
    • 84891758200 scopus 로고    scopus 로고
    • Java Memory Model examples: Good, bad, and ugly
    • D.Aspinall and J.Sevcik. Java Memory Model examples: Good, bad, and ugly. VAMP07 Proceedings http://www.cs.ru.nl/ chaack/VAMP07/,2007.
    • (2007) VAMP07 Proceedings
    • Aspinall, D.1    Sevcik, J.2


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