메뉴 건너뛰기




Volumn , Issue , 2006, Pages 273-280

A runtime scheduling method for dynamic and heterogeneous platforms

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION SYSTEMS; GRID COMPUTING; PARALLEL PROCESSING SYSTEMS;

EID: 34547318835     PISSN: 15302016     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPPW.2006.15     Document Type: Conference Paper
Times cited : (4)

References (25)
  • 3
    • 34547241605 scopus 로고    scopus 로고
    • O. Beaumont, L. Carter, J. Ferrante, A. Legrand, and Y. Robert. Bandwidth-centric allocation of independent task on heterogeneous platform. Technical Report 4210, INRIA, Rhône-Alpes, Grenoble(France), June 2001.
    • O. Beaumont, L. Carter, J. Ferrante, A. Legrand, and Y. Robert. Bandwidth-centric allocation of independent task on heterogeneous platform. Technical Report 4210, INRIA, Rhône-Alpes, Grenoble(France), June 2001.
  • 5
    • 0346879879 scopus 로고    scopus 로고
    • Optimal algorithms for scheduling divisible workloads on heterogeneous systems
    • Technical Report 4595, INRIA, Le ChesnayFrance, October
    • O. Beaumont, A. Legrand, and Y. Robert. Optimal algorithms for scheduling divisible workloads on heterogeneous systems. Technical Report 4595, INRIA, Le Chesnay(France), October 2002.
    • (2002)
    • Beaumont, O.1    Legrand, A.2    Robert, Y.3
  • 6
    • 0036186988 scopus 로고    scopus 로고
    • Efficient scheduling strategies for processing multiple divisible loads on bus networks
    • January
    • V. Bharadwaj and G. Barlas. Efficient scheduling strategies for processing multiple divisible loads on bus networks. Journal of Parallel and Distributed Computing, 62(1):132-151, January 2002.
    • (2002) Journal of Parallel and Distributed Computing , vol.62 , Issue.1 , pp. 132-151
    • Bharadwaj, V.1    Barlas, G.2
  • 9
    • 34547288216 scopus 로고    scopus 로고
    • A multi-round online scheduling method for grid computing. Technical
    • Report 05008INF, INT/GET, ÉvryFrance, September
    • S. Boutammine, D. Millot, and C. Parrot. A multi-round online scheduling method for grid computing. Technical. Report 05008INF, INT/GET, Évry(France), September 2005.
    • (2005)
    • Boutammine, S.1    Millot, D.2    Parrot, C.3
  • 11
    • 0037668916 scopus 로고    scopus 로고
    • Efficient movie retrieval strategies for movie-on-demand multimedia services on distributed networks
    • L. Dong, V. Bharadwaj, and C. Ko. Efficient movie retrieval strategies for movie-on-demand multimedia services on distributed networks. Multimedia Tools and Applications, 20(2):99-133, 2003.
    • (2003) Multimedia Tools and Applications , vol.20 , Issue.2 , pp. 99-133
    • Dong, L.1    Bharadwaj, V.2    Ko, C.3
  • 14
    • 33750016117 scopus 로고    scopus 로고
    • Np-completeness of the divisible load scheduling problem on heterogeneous star platforms with affine costs
    • Technical Report CS2005-0818, UCSD/CSE, March
    • A. Legrand, Y Yang, and H. Casanova. Np-completeness of the divisible load scheduling problem on heterogeneous star platforms with affine costs. Technical Report CS2005-0818, UCSD/CSE, March 2005.
    • (2005)
    • Legrand, A.1    Yang, Y.2    Casanova, H.3
  • 15
    • 85026733872 scopus 로고    scopus 로고
    • University of Iowa, Department of Computer Science
    • Y. Liu. Grid scheduling. University of Iowa, Department of Computer Science, http://www.cs.uiowa.edu/yanliu/QE/QEreview.pdf, 2004.
    • (2004) Grid scheduling
    • Liu, Y.1
  • 19
    • 85033344473 scopus 로고    scopus 로고
    • load scheduling
    • T. Robertazzi. Divisible load scheduling. http://www.ece.sunysb.edu/tom/ dlt.html.
    • Divisible
    • Robertazzi, T.1
  • 20
    • 0038399884 scopus 로고    scopus 로고
    • Ten reasons to use divisible load, theory
    • 63-68
    • T Robertazzi. Ten reasons to use divisible load, theory. IEEE Computer, 36(5)(63-68), 2003.
    • (2003) IEEE Computer , vol.36 , Issue.5
    • Robertazzi, T.1
  • 21
    • 33750284729 scopus 로고    scopus 로고
    • Load sharing controller for optimizing monetary cost,
    • March 30, US patent, 5,889,989
    • T Robertazzi, J. Sohn, and S. Luryi. Load sharing controller for optimizing monetary cost, March 30 1999. US patent # 5,889,989.
    • (1999)
    • Robertazzi, T.1    Sohn, J.2    Luryi, S.3
  • 25
    • 34547276674 scopus 로고    scopus 로고
    • UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads
    • April
    • Y. Yang and H. Casanova. UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads. IEEE Computing Society Press, April 2003.
    • (2003) IEEE Computing Society Press
    • Yang, Y.1    Casanova, H.2


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