Grid Task Scheduling Based on Constraint Satisfaction Neural Network
Task scheduling is of great significance to shorten performing time and minimize the cost for computational Grid.A grid task schedule algorithm is presented in this paper,which is based on a constraint satisfaction neural network.The constraint satisfaction means to remove the violations for sequence and resource constraints during scheduling subtasks for grid environment The data-transferring costs among subtasks are also considered in our task scheduling.The simulation in this paper has shown that the task schedule algorithm is efficient with respect to the quality of solutions and the solving speed.
constraint task scheduling grid neural network
DONG Yueli GUO Quan
Department of Computer Science and Technology,Dalian Neusoft Institute of Information,116023
国际会议
The 2nd IEEE International Conference on Advanced Computer Control(第二届先进计算机控制国际会议 ICACC 2010)
沈阳
英文
513-515
2010-03-27(万方平台首次上网日期,不代表论文的发表时间)