Ant Algorithm with Execution Quality Based Prediction in Grid Scheduling

被引：0

作者：

Zhu, Yiqun ^{[1
]}

Li, Minglu ^{[1
]}

Weng, Chuliang ^{[1
]}

机构：

[1] Shanghai Jiao Tong Univ, Dept Comp Sci, Shanghai 200030, Peoples R China

来源：

FOURTH CHINAGRID ANNUAL CONFERENCE, PROCEEDINGS | 2009年

关键词：

improved ant algorithm; task scheduling; grid computing; power grid;

D O I：

10.1109/ChinaGrid.2009.16

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Task scheduling is one important job in Grid computing and also a hard and complex problem. We have quite a few algorithm of task scheduling in the past researches. Ant Algorithm is a heuristic algorithm. The inherent parallelism and scalability make this algorithm meet the requirement of complex task scheduling in Grid computing. In this paper, we will propose an improved ant algorithm in our power grid environment. We made several improvements on the calculation of pheromone and task issue method as well. The improved algorithm becomes more sensitive with the power grid environment and more robust with heavy workload.

引用

页码：77 / 83

页数：7

共 14 条

[1]

BAKER M, 2002, SOFTWARE PRACTICE EX

[2]

BITTEN C, 2000, HET GEN COMP WORKSH

[3] GridSim: a toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing [J].

Buyya, R ;

Murshed, M .

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2002, 14 (13-15) :1175-1220

[4]

CASANOVA H, 2002, CONCURRENCY PRACTICE

[5]

DETMK F, 2002, FUTURE GENER COMP SY, V18, P549

[6]

DIMARTINO VM, 2002, PAR DISTR PROC S P I

[7] Utilization and predictability in scheduling the IBM SP2 with backfilling [J].

Feitelson, DG ;

Weil, AM .

FIRST MERGED INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, 1998, :542-546

[8]

HOTOVY S, 1996, LECT NOTES COMPUTER, V1162, P27

[9]

Krallmann J, 1999, LECT NOTES COMPUT SC, V1659, P17

[10]

Lifka D.A., 1995, LECT NOTES COMPUTER, V949, P295

← 1 2 →