Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
UET scheduling with unit interprocessor communication delays
Discrete Applied Mathematics
VLSI array processors
Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
List scheduling with and without communication delays
Parallel Computing
Artificial intelligence: a new synthesis
Artificial intelligence: a new synthesis
Genetic Scheduling for Parallel Processor Systems: Comparative Studies and Performance Issues
IEEE Transactions on Parallel and Distributed Systems
Constraint-Based Scheduling
Low-Cost Task Scheduling for Distributed-Memory Machines
IEEE Transactions on Parallel and Distributed Systems
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
A Comparison of Heuristics for Scheduling DAGs on Multiprocessors
A Comparison of Heuristics for Scheduling DAGs on Multiprocessors
A Performance Evaluation of CP List Scheduling Heuristics for Communication Intensive Task Graphs
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Artificial Intelligence: Structures and Strategies for Complex Problem Solving (5th Edition)
Artificial Intelligence: Structures and Strategies for Complex Problem Solving (5th Edition)
An Incremental Genetic Algorithm Approach to Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
Communication Contention in Task Scheduling
IEEE Transactions on Parallel and Distributed Systems
Parallel Computing - Heterogeneous computing
On multiprocessor task scheduling using efficient state space search approaches
Journal of Parallel and Distributed Computing
Task Scheduling for Parallel Systems (Wiley Series on Parallel and Distributed Computing)
Task Scheduling for Parallel Systems (Wiley Series on Parallel and Distributed Computing)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Scheduling Algorithm Based on Force Directed Clustering
PDCAT '08 Proceedings of the 2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies
Parallel Algorithms
Optimal linear programming solutions for multiprocessor scheduling with communication delays
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Reducing the solution space of optimal task scheduling
Computers and Operations Research
| Hi-index | 0.00 |
Scheduling tasks onto the processors of a parallel system is a crucial part of program parallelisation. Due to the NP-hard nature of the task scheduling problem, scheduling algorithms are based on heuristics that try to produce good rather than optimal schedules. Nevertheless, in certain situations it is desirable to have optimal schedules, for example for time-critical systems or to evaluate scheduling heuristics. This paper investigates the task scheduling problem using the A* search algorithm which is a best-first state space search. The adaptation of the A* search algorithm for the task scheduling problem is referred to as the A* scheduling algorithm. The A* scheduling algorithm can produce optimal schedules in reasonable time for small to medium sized task graphs with several tens of nodes. In comparison to a previous approach, the here presented A* scheduling algorithm has a significantly reduced search space due to a much improved consistent and admissible cost function f(s) and additional pruning techniques. Experimental results show that the cost function and the various pruning techniques are very effective for the workload. Last but not least, the results show that the proposed A* scheduling algorithm significantly outperforms the previous approach.