An adaptive scheduling method for grid computing

被引:0
作者
Boutammine, Salah-Salim [1 ]
Millot, Daniel [1 ]
Parrot, Christian [1 ]
机构
[1] Inst Natl Telecommun, GET, Dept Informat, F-91011 Evry, France
来源
EURO-PAR 2006 PARALLEL PROCESSING | 2006年 / 4128卷
关键词
scheduling; parallel application; grid; master-worker; on-line; multi-round; heterogeneity; dynamicity;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper presents an adaptive scheduling method, which can be used for parallel applications whose total workload is unknown a priori. This method can deal with the unpredictable execution conditions commonly encountered on grids. To address this scheduling problem, parameters which quantify the dynamic nature of the execution conditions had to be defined. The proposed scheduling method is based on an online algorithm so as to be adaptable to the varying execution conditions, but avoids the idle periods inherent to this on-line algorithm.
引用
收藏
页码:188 / 197
页数:10
相关论文
共 14 条
  • [1] [Anonymous], 1996, Scheduling Divisible Loads in Parallel and Distributed Systems
  • [2] BEAUMONT O, 2002, 4595 INRIA
  • [3] BEAUMONT O, 2004, THESIS U BORDEAUX 1
  • [4] MULTI-INSTALLMENT LOAD DISTRIBUTION IN TREE NETWORKS WITH DELAYS
    BHARADWAJ, V
    GHOSE, D
    MANI, V
    [J]. IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 1995, 31 (02) : 555 - 567
  • [5] BOUTAMMINE S, 2006, P 2006 INT C PAR PRO
  • [6] CASANOVA H, 2003, P 3 INT S CLUST COMP
  • [7] Drozdowski M., 1997, THESIS I INFORM POLI
  • [8] LEGRAND A, 2005, CS20050818 UCSD CSE
  • [9] MARCHAL L, 2006, IN PRESS INT J HIGH
  • [10] Pruhs K., 2004, Handbook of Scheduling-Algorithms