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
Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
Efficient memory-bounded search methods
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
List scheduling with and without communication delays
Parallel Computing
MILP based task mapping for heterogeneous multiprocessor systems
EURO-DAC '96/EURO-VHDL '96 Proceedings of the conference on European design automation
Genetic Scheduling for Parallel Processor Systems: Comparative Studies and Performance Issues
IEEE Transactions on Parallel and Distributed Systems
Clustering Algorithm for Parallelizing Software Systems in Multiprocessors Environment
IEEE Transactions on Software Engineering - Special issue on architecture-independent languages and software tools parallel processing
An Efficient Adaptive Scheduling Scheme for Distributed Memory Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
Hypertool: A Programming Aid for Message-Passing Systems
IEEE Transactions on Parallel and Distributed Systems
Scheduling Task Graphs on Arbitrary Processor Architectures Considering Contention
HPCN Europe 2001 Proceedings of the 9th International Conference on High-Performance Computing and Networking
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
An Incremental Genetic Algorithm Approach to Multiprocessor 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
Efficient Techniques for Clustering and Scheduling onto Embedded Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Task Scheduling for Parallel Systems (Wiley Series on Parallel and Distributed Computing)
Task Scheduling for Parallel Systems (Wiley Series on Parallel and Distributed Computing)
A comparison of multiprocessor task scheduling algorithms with communication costs
Computers and Operations Research
A performance study of multiprocessor task scheduling algorithms
The Journal of Supercomputing
Journal of Parallel and Distributed Computing
Scheduling for Parallel Processing
Scheduling for Parallel Processing
Scheduling task graphs optimally with A*
The Journal of Supercomputing
Artificial Intelligence: Foundations of Computational Agents
Artificial Intelligence: Foundations of Computational Agents
| Hi-index | 0.01 |
Many scheduling problems are tackled by heuristics due to their NP-hard nature. Task scheduling with communication delays (P|prec,c"i"j|C"m"a"x) is no exception. Nevertheless, it can be of significant advantage to have optimal schedules, e.g. for time critical systems or as a baseline to evaluate heuristics. A promising approach to optimal task scheduling with communication delays for small problems is the use of exhaustive search techniques such as A^@?. A^@? is a best first search algorithm guided by a cost function. While good cost functions reduce the search space, early results have shown that problem specific pruning techniques are paramount. This paper proposes two novel pruning techniques that significantly reduce the search space for P|prec,c"i"j|C"m"a"x. The pruning techniques Fixed Task Order and Equivalent Schedules are carefully investigated based on observations made with simple graph structures such as fork, join and fork-join, yet they are generally applicable. An extensive experimental evaluation of computing more than two thousand schedules demonstrates the efficiency of the novel pruning techniques in significantly reducing the solution space.