An Improved Scheduling Algorithm Based on Integer Programming in Grid Computing  

作　　者：YI Kan WANG Ruchuan JI Yimu 

机构地区：[1]College of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210003, China [2]State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210093, China

出　　处：《Chinese Journal of Electronics》2009年第2期307-311,共5页电子学报（英文版）

基　　金：This work is supported by the National Natural Science Foundation of China （No.60573141, No.60773041）, National 863 High Technology Research Program of China （No.2006AA01Z201, No.2006AA01Z219, No.2006AA01Z439, No.2007AA01Z404, No.2007AA01Z478）, High Technology Research Programme of Jiangsu Province （No.BG2006001）, High Technology Research Programme of Nanjing （No.2007RZ106, No.2007RZ127）, Foundation of National Laboratory for Modern Communications （No.9140Cl105040805） and Key Laboratory of Information Technology Processing of Jiangsu Province （No.kjs06006）. Project sponsored by Jiangsu provincial research scheme of natural science for higher education institutions （No.07KJB520083）.

摘　　要：Task scheduling is one of key issues in grid computing. This paper focused on the task scheduling problem with a large scale of independent and identical tasks. An improved task scheduling algorithm DMIP is put forward, which is based on time and cost constrains combined with Integer programming but can control the max number of tasks dynamically. Compared with plain Integer programming algorithm, named IP, which only considering time constrains, DMIP algorithm reduced both loss ratios of tasks during the submitting process and the total execution cost by simulation experiments.

关 键 词：Grid computing Task scheduling Integer programming. 

分 类 号：O221.4[理学—运筹学与控制论] TP301.6[理学—数学]