메뉴 건너뛰기




Volumn 29, Issue 1, 2003, Pages 161-166

A task duplication based scheduling algorithm for shared memory multiprocessors

Author keywords

Directed acyclic graph; Heuristics; Shared memory multiprocessors; Task duplication; Task scheduling

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; HEURISTIC METHODS; SCHEDULING;

EID: 0037239227     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(02)00181-3     Document Type: Article
Times cited : (2)

References (5)
  • 1
    • 44049113422 scopus 로고
    • A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
    • Gerasoulis A., Yang T. A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors. Journal of Parallel and Distributed Computing. 16:1992;276-291.
    • (1992) Journal of Parallel and Distributed Computing , vol.16 , pp. 276-291
    • Gerasoulis, A.1    Yang, T.2
  • 4
    • 0001957555 scopus 로고    scopus 로고
    • A task duplication based scalable scheduling algorithm for distributed memory systems
    • Darbha S., Agrawal D.P. A task duplication based scalable scheduling algorithm for distributed memory systems. Journal of Parallel and Distributed Computing. 46:1997;15-26.
    • (1997) Journal of Parallel and Distributed Computing , vol.46 , pp. 15-26
    • Darbha, S.1    Agrawal, D.P.2


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