메뉴 건너뛰기




Volumn 4537 LNCS, Issue , 2007, Pages 229-234

Policy based scheduling for resource allocation on grid

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER RESOURCE MANAGEMENT; QUALITY OF SERVICE; RESOURCE ALLOCATION; SCHEDULING ALGORITHMS;

EID: 38049090559     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72909-9_25     Document Type: Conference Paper
Times cited : (2)

References (4)
  • 2
    • 0030142084 scopus 로고    scopus 로고
    • Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors
    • Kwok, Y.K., Ahmad, I.: 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
  • 4
    • 35048856562 scopus 로고    scopus 로고
    • Zhao, H., Sakellariou, R.: An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm. Euro-Par 2003, LNCS, 2790, Springer, Heidelberg (2003)
    • Zhao, H., Sakellariou, R.: An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm. Euro-Par 2003, LNCS, vol. 2790, Springer, Heidelberg (2003)


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