메뉴 건너뛰기




Volumn , Issue , 2008, Pages

Fault tolerant scheduling of precedence task graphs on heterogeneous platforms

Author keywords

Fault tolerance; Heterogeneous systems; Multi criteria scheduling; Precedence task graphs; Reliability; Scheduling

Indexed keywords

PARALLEL PROCESSING SYSTEMS; RELIABILITY; SCHEDULING; SCHEDULING ALGORITHMS;

EID: 51049117485     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2008.4536133     Document Type: Conference Paper
Times cited : (72)

References (7)
  • 2
    • 51049100724 scopus 로고    scopus 로고
    • A. Benoit, M. Hakem, and Y. Robert. Fault Tolerant Scheduling of Precedence Task Graphs on Heterogeneous Platforms. Research Report 2008-03, LIP, ENS Lyon, France, Jan. 2008. Available at graal.ens-lyon.fr/~abenoit/.
    • A. Benoit, M. Hakem, and Y. Robert. Fault Tolerant Scheduling of Precedence Task Graphs on Heterogeneous Platforms. Research Report 2008-03, LIP, ENS Lyon, France, Jan. 2008. Available at graal.ens-lyon.fr/~abenoit/.
  • 4
    • 12444323075 scopus 로고    scopus 로고
    • Distributed adaptive task allocation in heterogeneous computing environments to maximize throughput
    • IEEE Computer Society Press
    • B. Hong and V. Prasanna. Distributed adaptive task allocation in heterogeneous computing environments to maximize throughput. In International Parallel and Distributed Processing Symposium IPDPS'2004. IEEE Computer Society Press, 2004.
    • (2004) International Parallel and Distributed Processing Symposium IPDPS'2004
    • Hong, B.1    Prasanna, V.2
  • 5
    • 33747806256 scopus 로고    scopus 로고
    • A novel fault-tolerant scheduling algorithm for precedence constrained tasks in real-time heterogeneous systems
    • X. Qin and H. Jiang. A novel fault-tolerant scheduling algorithm for precedence constrained tasks in real-time heterogeneous systems. Parallel Computing, 32(5):331-346, 2006.
    • (2006) Parallel Computing , vol.32 , Issue.5 , pp. 331-346
    • Qin, X.1    Jiang, H.2
  • 6
    • 84957009164 scopus 로고    scopus 로고
    • Scheduling task graphs on arbitrary processor architectures considering contention
    • High Performance Computing and Networking, Springer-Verlag
    • O. Sinnen and L. Sousa. Scheduling task graphs on arbitrary processor architectures considering contention. In High Performance Computing and Networking, pages 373-382. Springer-Verlag LNCS 2110, 2001.
    • (2001) LNCS , vol.2110 , pp. 373-382
    • Sinnen, O.1    Sousa, L.2
  • 7
    • 85030051418 scopus 로고
    • Massively parallel computing systems with real-time constraints: The algorithm architecture adequation
    • Y. Sorel. Massively parallel computing systems with real-time constraints: the "algorithm architecture adequation". In Proc. of Massively Parallel Comput. Syst., MPCS, 1994.
    • (1994) Proc. of Massively Parallel Comput. Syst., MPCS
    • Sorel, Y.1


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