To narrow the scope of rescheduling tasks is one of the effective ways to improve the grid dependent tasks rescheduling efficiency. For how to determine the scope which should improve the efficiency of rescheduling problem as far as possible without affecting the application performance, this paper proposed the rescheduling tasks spread domain concept and its method of computation. Beginning with a minimum tasks set to rescheduling, the computing process is oriented by resource share conflict and data transmission dependent of tasks, and limited by the degree of task to optimize the performance of the whole application. Experimentation results show that static scheduling strategy could maintain the performance advantages compare with the dynamic strategy, thus the efficiency of proposed rescheduling tasks spread domain is validated.
Chen, Tingwei; Zhu, Hongning; Dai, Yu; and Hao, Xianwen
"Rescheduling Oriented Dependent Tasks Spread Domain Computing,"
Applied Mathematics & Information Sciences: Vol. 07:
6, Article 36.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol07/iss6/36