메뉴 건너뛰기




Volumn 13, Issue 6, 2002, Pages 529-543

Compile time barrier synchronization minimization

Author keywords

Barrier minimization; Compiler optimization; Efficient parallelization; Graph algorithms; Synchronization reduction

Indexed keywords

BENCHMARKING; COMPUTATIONAL COMPLEXITY; DATA FLOW ANALYSIS; DATA HANDLING; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; SOFTWARE PROTOTYPING; TIME SHARING PROGRAMS;

EID: 0036612639     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2002.1011394     Document Type: Article
Times cited : (12)

References (35)
  • 6
    • 0009822733 scopus 로고
    • A global approach to detection of parallelism
    • PhD dissertation, Dept. of Computer Science, Rice Univ.
    • (1987)
    • Callahan, D.1
  • 7
    • 0009868048 scopus 로고
    • Compiler optimizations for parallel loops with fine-grained synchronization
    • PhD dissertation, Univ. of Illinois at Urbana-Champaign
    • (1994)
    • Chen, D.-K.1
  • 9
    • 0003909208 scopus 로고
    • Compile-time scheduling and optimizations for asynchronous machines
    • PhD dissertation, Univ. of Illinois at Urbana-Champaign
    • (1984)
    • Cytron, R.1
  • 18
    • 4243637701 scopus 로고
    • Automatic generation of synchronization instructions for parallel processors
    • MS Thesis, CSRD Rep. 588, Univ. of Illinois at Urbana-Champaign, May
    • (1986)
    • Midkiff, S.P.1


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