Research on the Possibility of Regulating Scheduling Length after Eliminating Intra-Iteration Dependency

ABSTRACT

Recently, scheduling algorithm which is related to computing tasks and communication transactions is widely studied. In multi-core systems, adopting certain scheduling algorithm to execute schedule can decrease scheduling length effectively after eliminating intra-iteration dependency of the computing tasks. In this case, regulating execution order of computing tasks can make further compression of the scheduling length in consideration of the effect generated by communication tasks. The experiment proved the necessity of decreasing scheduling length by regulating execution order of computing tasks according to the specific situation after achieving the initial scheduling length by adopting certain scheduling algorithm without the intra-iteration dependence of computing tasks. This study has great significance for the design of scheduling algorithm in the multi-core environment.

Keywords: