메뉴 건너뛰기




Volumn , Issue , 2004, Pages 402-409

Dynamic scheduling of parallel jobs with QoS demands in multiclusters and grids

Author keywords

[No Author keywords available]

Indexed keywords

GRID COMPUTING ARCHITECTURES; MULTICLUSTERS; RESOURCE UTILIZATION; WORKLOAD MANAGEMENT;

EID: 19944379474     PISSN: 15505510     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GRID.2004.27     Document Type: Conference Paper
Times cited : (52)

References (15)
  • 12
    • 0242656067 scopus 로고    scopus 로고
    • Backfilling with lookahead to optimize the performance of parallel job scheduling
    • D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn (Eds.), Springer-Verlag
    • E. Shmueli and D. G. Feitelson, "Backfilling with lookahead to optimize the performance of parallel job scheduling," In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn (Eds.), pp. 228-251, Springer-Verlag, 2003.
    • (2003) Job Scheduling Strategies for Parallel Processing , pp. 228-251
    • Shmueli, E.1    Feitelson, D.G.2
  • 15
    • 84904310496 scopus 로고
    • Limit allocation: An efficient processor management scheme for hypercubes
    • C. Yu and C. R. Das, "Limit Allocation: An Efficient Processor Management Scheme for Hypercubes," Proc. Int. Conf. Parallel Processing (ICPP94), 1994.
    • (1994) Proc. Int. Conf. Parallel Processing (ICPP94)
    • Yu, C.1    Das, C.R.2


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