IEEE Transactions on Parallel and Distributed Systems
Scheduling In and Out Forests in the Presence of Communication Delays
IEEE Transactions on Parallel and Distributed Systems
Efficient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm
Journal of Parallel and Distributed Computing - Special issue on parallel evolutionary computing
Benchmarking and comparison of the task graph scheduling algorithms
Journal of Parallel and Distributed Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
IEEE Transactions on Parallel and Distributed Systems
Scheduling DAG's for Asynchronous Multiprocessor Execution
IEEE Transactions on Parallel and Distributed Systems
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Proceedings of the conference on Design, automation and test in Europe
A performance study of multiprocessor task scheduling algorithms
The Journal of Supercomputing
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
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
A unified approach for the evaluation of quay crane scheduling models and algorithms
Computers and Operations Research
Toward optimizing latency under throughput constraints for application workflows on clusters
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
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
SAPPHIRE: A toolkit for building efficient stream programs for medical video analysis
Computer Methods and Programs in Biomedicine
Hi-index | 0.01 |
Scheduling program tasks on processors is at the core of the efficient use of multiprocessor systems. Most task-scheduling problems are known to be NP-Hard and, thus, heuristics are the method of choice in all but the simplest cases. The utilization of acknowledged sets of benchmark-problem instances is essential for the correct comparison and analysis of heuristics. Yet, such sets are not available for several important classes of scheduling problems, including multiprocessor scheduling problem with communication delays (MSPCD) where one is interested in scheduling dependent tasks onto homogeneous multiprocessor systems, with processors connected in an arbitrary way, while explicitly accounting for the time required to transfer data between tasks allocated to different processors. We propose test-problem instances for the MSPCD that are representative in terms of number of processors, type of multiprocessor architecture, number of tasks to be scheduled, and task graph characteristics (task execution times, communication costs, and density of dependencies between tasks). Moreover, we define our task-graph generators in a way appropriate to ensure that the corresponding problem instances obey the theoretical principles recently proposed in the literature.