Hindsight Helps: Deterministic Task Scheduling with Backtracking
ICPP '97 Proceedings of the international Conference on Parallel Processing
Simultaneous Compression of Makespan and Number of Processors Using CRP
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Task Scheduling Algorithms for Heterogeneous Processors
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
An Efficient Quantum-Behaved Particle Swarm Optimization for Multiprocessor Scheduling
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
| Hi-index | 0.00 |
An algorithm for compile-time static scheduling of task graphs onto multiprocessors is proposed. The proposed algorithm, which is called Dynamic Critical Path (DCP) scheduling algorithm, is different from previously reported algorithms in a number of ways. First, it determines the critical path of the task graph and selects the next node to be scheduled in a dynamic fashion. Second, it rearranges the schedule on each processor dynamically in the sense that the positions of the nodes in the partial schedules are not fixed until all nodes have been considered. Third, it uses an intelligent way to select a suitable processor for a node by looking ahead the potential start times of the remaining critical nodes on that processor and by scheduling relatively less important nodes to the processors already in use. Four related scheduling algorithms are also discussed. Although these algorithms are efficient in general, they possess drawbacks which can lead to poor performance. The proposed DCP algorithm overcomes the drawbacks of these algorithms and outperforms them by a considerable margin. Despite having a number of new features, the DCP algorithm is fast, efficient in terms of the number of processors used and is equally suitable for different types of graph structures.