Task Scheduling in Distributed Sy stem Based on Dynamic Multi Processing Nodes
Liang Gen, Yong Hui Qin, Xiaoxue Guo, Liang Huo-min · Jisuanji gongcheng · 2009
【Abstract】Aiming at the problem of poor control ability of distributed system with fixed nodes, this paper gives a task scheduling model of distributed system. The problem of task scheduling in single node is discussed. In order to depict the capability of load-tolerance clearly, the processing intensity concept is drawn. The method of task scheduling among dynamic multi processing nodes is deduced to optimize the characteristic of responsibility time in task scheduling. Simulation experiments show that this algorithm has a better control ability, and it can reduce load of processor, improve the performance of the task-processed delay and use the resource of system more legitimately.