메뉴 건너뛰기




Volumn , Issue , 2009, Pages 325-336

A case for an interleaving constrained shared-memory multi-processor

Author keywords

Concurrency bugs; Multiprocessors; Parallel programming; Software reliability

Indexed keywords

CONCURRENCY BUGS; DATA RACES; INTERLEAVINGS; MOZILLA; MULTI-THREADED PROGRAMS; MULTIPROCESSORS; MULTITHREADED; OPEN SOURCE APPLICATION; PERFORMANCE COSTS; PRODUCTION SYSTEM; ROOT CAUSE; RUNTIMES; SHARED MEMORIES; SHARED MEMORY MULTIPROCESSOR; SINGLE-THREADED;

EID: 70450285526     PISSN: 10636897     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1555754.1555796     Document Type: Conference Paper
Times cited : (146)

References (25)
  • 8
    • 0017996760 scopus 로고
    • Time, clocks, and the ordering of events in a distributed system
    • L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-565, 1978.
    • (1978) Communications of the ACM , vol.21 , Issue.7 , pp. 558-565
    • Lamport, L.1
  • 17
    • 0038346243 scopus 로고    scopus 로고
    • Reenact: Using thread-level speculation mechanisms to debug data races in multithreaded codes
    • San Diego, CA, June
    • M. Prvulovic and J. Torrelas. Reenact: Using thread-level speculation mechanisms to debug data races in multithreaded codes. In 30th Annual International Symposium on Computer Architecture, San Diego, CA, June 2003.
    • (2003) 30th Annual International Symposium on Computer Architecture
    • Prvulovic, M.1    Torrelas, J.2


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