The Priority Tasks Scheduling Algorithm Based on Grid Resource Prediction

被引：0

作者：

Liu, Hongwei ^{[1
,3
]}

Yu, Jiong ^{[1
,2
,3
]}

Tian, Guozhong ^{[3
,4
]}

Gong, Hongcui ^{[1
,2
]}

机构：

[1] Xinjiang Univ, Sch Informat Sci & Engn, Urumqi, Peoples R China

[2] Beijing Inst Technol, Sch Comp Sci & Technol, Beijing 100081, Peoples R China

[3] Beijing Univ Technol, Coll Comp Sci & Technol, Beijing 100124, Peoples R China

[4] Xinjiang Polytech, Dept Comp Engn, Urumqi, Peoples R China

来源：

FOURTH CHINAGRID ANNUAL CONFERENCE, PROCEEDINGS | 2009年

基金：

中国国家自然科学基金;

关键词：

Workflow; Grid; Resource State; Priority;

D O I：

10.1109/ChinaGrid.2009.23

中图分类号：

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

学科分类号：

0812 ;

摘要：

According to the dependence and deadline of the grid workflow tasks, the effective degrees and MIPS of the grid resources, a new algorithm called the priority tasks scheduling algorithm based on the grid resource prediction is presented. The algorithm uses DAG to find the critical path, obtain the deadline of every task and compute their PRI (priority). The algorithm takes the below problems into consideration: the request of user, the type of resources and re-scheduling of failed tasks. The result shows that the algorithm is effective.

引用

页码：84 / +

页数：2

共 6 条

[1]

BIVENS HP, 2001, GRID WORKFLOW DISTRI

[2] MJS']JSA: Markov job sclieduler based on availability in desktop grid computing environment [J].

Byun, EunJoung ;

Choi, SungJin ;

Baik, MaengSoon ;

Gil, JoonMin ;

Park, ChanYeol ;

Hwang, ChongSun .

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF GRID COMPUTING THEORY METHODS AND APPLICATIONS, 2007, 23 (04) :616-622

[3]

GRAHAM GE, 2003, C COMP HIGH EN NUCL

[4]

Wu M.-Y., 1990, IEEE Transactions on Parallel and Distributed Systems, V1, P330, DOI 10.1109/71.80160

[5]

Yu J, 2005, Journal of Grid Computing, V3, P171, DOI [10.1007/s10723-005-9010-8, DOI 10.1007/S10723-005-9010-8]

[6]

YU J, 2005, 1 IEEE INT C E SCI G

← 1 →