메뉴 건너뛰기




Volumn , Issue , 2010, Pages 243-252

A bi-criteria algorithm for scheduling parallel task graphs on clusters

Author keywords

[No Author keywords available]

Indexed keywords

BATCH SCHEDULERS; BI-CRITERIA; COMPLETION TIME; HOMOGENEOUS CLUSTER; MAKESPAN; PARALLEL PLATFORMS; PARALLEL TASK; PERFORMANCE METRICS; RESOURCE MANAGERS; RESOURCE USAGE; TASK PARALLELISM;

EID: 77954899572     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCGRID.2010.43     Document Type: Conference Paper
Times cited : (8)

References (17)
  • 4
    • 33750220215 scopus 로고    scopus 로고
    • A pragmatic analysis of scheduling environments on new computing platforms
    • L. Eyraud, "A Pragmatic Analysis of Scheduling Environments on New Computing Platforms, " International Journal of High Performance Computing and Applications, vol. 20, no. 4, pp. 507-516, 2006.
    • (2006) International Journal of High Performance Computing and Applications , vol.20 , Issue.4 , pp. 507-516
    • Eyraud, L.1
  • 6
    • 33750613139 scopus 로고    scopus 로고
    • An improved two-step algorithm for task and data parallel scheduling in distributed memory machines
    • S. Bansal, P. Kumar, and K. Singh, "An Improved Two-Step Algorithm for Task and Data Parallel Scheduling in Distributed Memory Machines, " Parallel Computing, vol. 32, no. 10, pp. 759-774, 2006.
    • (2006) Parallel Computing , vol.32 , Issue.10 , pp. 759-774
    • Bansal, S.1    Kumar, P.2    Singh, K.3
  • 10
    • 84943254220 scopus 로고    scopus 로고
    • Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints
    • Algorithms - ESA 2001
    • R. Lepere, D. Trystram, and G. Woeginger, "Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints, " in Proceedings of the 9th Annual European Symposium on Algorithms - ESA 2001, ser. LNCS, Springer-Verlag, Ed., no. 2161, 2001, pp. 146-157. (Pubitemid 33328954)
    • (2001) LECTURE NOTES IN COMPUTER SCIENCE , Issue.2161 , pp. 146-157
    • Lepere, R.1    Trystram, D.2    Woeginger, G.J.3
  • 11
    • 33749000266 scopus 로고    scopus 로고
    • An approximation algorithm for scheduling malleable tasks under general precedence constraints
    • K. Jansen and H. Zhang, "An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence Constraints, " ACM Transactions on Algorithms, vol. 2, no. 3, pp. 416-434, 2006.
    • (2006) ACM Transactions on Algorithms , vol.2 , Issue.3 , pp. 416-434
    • Jansen, K.1    Zhang, H.2
  • 14
    • 77954921397 scopus 로고    scopus 로고
    • Grid'5000, "http://www.grid5000.fr.".
    • Grid'5000


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