메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages

Dynamic critical path scheduling parallel programs onto multiprocessors

Author keywords

Clustering; Directed acyclic graphs dAGs; Distributed computing; Parallel scheduling; Precedence task graphs; Scheduling

Indexed keywords

CLUSTERING; DIRECTED ACYCLIC GRAPHS DAGS; DISTRIBUTED COMPUTING; PARALLEL SCHEDULING; PRECEDENCE TASK GRAPHS;

EID: 33746275243     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2005.175     Document Type: Conference Paper
Times cited : (17)

References (9)
  • 6
    • 0030142084 scopus 로고    scopus 로고
    • Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors
    • Y.-K. Kwok and I. Ahmad. Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 7(5):506-521, 1996.
    • (1996) IEEE Transactions on Parallel and Distributed Systems , vol.7 , Issue.5 , pp. 506-521
    • Kwok, Y.-K.1    Ahmad, I.2
  • 9
    • 0027841407 scopus 로고
    • List scheduling with and without communication delays
    • T. Yang and A. Gerasoulis. List scheduling with and without communication delays. Parallel Computing, 19(2):1321-1344, 1993.
    • (1993) Parallel Computing , vol.19 , Issue.2 , pp. 1321-1344
    • Yang, T.1    Gerasoulis, A.2


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