Scheduling algorithm for expected target-oriented tasks
Zhi Hong · Jisuanji gongcheng yu sheji · 2005
In actual practice there exists a sort of applications that don'd require to run as fast as possible.Some of them even have to run according to the speed designated in advance,and to take information resource generator,network electric policeman and interfaced applications for example.All of the previous task scheduling algorithms can't be applied to these applications correctly any longer.For this reason,a scheduling algorithm for expected target-oriented tasks is presented.On the premise of reaching the expected target,this algorithm schedules task to the least processors,aiming at accomplishing the scheduled task correctly by utilizing the least processors on time.The data analysis in the experiment shows that this algorithm is practical and effective.