A Heuristic Scheduling Algorithm for Computing of Power Grid

Task scheduling is an important issue in Power Grid. In Power Grid, Power system Computing applications are always broken down into several sub-tasks depending on each other, which can be represented as a DAG. Those sub-tasks often require specific grid resources and the computational capabilities of these resources may be different. So if we want to take advantage of Power Grid, an efficient scheduling algorithm is necessary to assign sub-tasks to the appropriate resources. In this paper, we present a heuristic scheduling algorithm that is based on the characteristic of the computing of Power Grid. This algorithm firstly constructs a Main Sequence based on Critical Path Task, then, according to the defined priority, assigns the tasks in the slain Sequence to the appropriate resources. Experiments were conducted to evaluate the performance of the algorithm. It showed that this algorithm is superior to other heuristics.