Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
List scheduling with and without communication delays
Parallel Computing
Genetic Scheduling for Parallel Processor Systems: Comparative Studies and Performance Issues
IEEE Transactions on Parallel and Distributed Systems
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
Low-Cost Task Scheduling for Distributed-Memory Machines
IEEE Transactions on Parallel and Distributed Systems
Scheduling Iterative Programs onto LogP-Machine
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Scheduling Task Graphs on Arbitrary Processor Architectures Considering Contention
HPCN Europe 2001 Proceedings of the 9th International Conference on High-Performance Computing and Networking
Parallel Computing - Heterogeneous computing
Computers and Operations Research
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)
Scheduling Algorithm Based on Force Directed Clustering
PDCAT '08 Proceedings of the 2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Scheduling task graphs optimally with A*
The Journal of Supercomputing
| Hi-index | 0.00 |
Task parallelism does not automatically scale with the use of parallel processors. Optimised scheduling of tasks is necessary to maximise the utilisation of each available processor. It is common to use heuristics to find solutions for task scheduling problem instances. However, there is no guarantee that the heuristic solution is close to the optimal solution. The outcome of this work is to provide optimal solutions for small and medium sized instances of the task scheduling problem. Two optimal scheduling formulations using Integer Linear Programming (ILP) are proposed for the Multiprocessor Scheduling Problem with Communication Delays: ILP-RevisedBoolean Logic and ILP-Transitivity Clause. ILP-RevisedBooleanLogic is designed to work efficiently when the number of processors available to be scheduled on is small. ILP-TransitivityClause is efficient when a larger number of processors are available to be scheduled on. Each formulation uses a different linearisation of the Integer Bilinear Programming formulation and is tested on CPLEX using known benchmark graphs for task scheduling.