Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
Towards an architecture-independent analysis of parallel algorithms
SIAM Journal on Computing
PYRROS: static task scheduling and code generation for message passing multiprocessors
ICS '92 Proceedings of the 6th international conference on Supercomputing
Task Clustering and Scheduling for Distributed Memory Parallel Architectures
IEEE Transactions on Parallel and Distributed Systems
LogP: a practical model of parallel computation
Communications of the ACM
Optimal Scheduling Algorithm for Distributed-Memory Machines
IEEE Transactions on Parallel and Distributed Systems
List scheduling of general task graphs under LogP
Parallel Computing - Special issue on new trends on scheduling in parallel and distributed systems
A comparison of list schedules for parallel processing systems
Communications of the ACM
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
Grain Size Determination for Parallel Processing
IEEE Software
Hypertool: A Programming Aid for Message-Passing Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Realistic Model and an Efficient Heuristic for Scheduling with Heterogeneous Processors
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A New Heuristic for Scheduling Parallel Programs on Multiprocessor
PACT '98 Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques
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
Static task scheduling and grain packing in parallel processing systems
Static task scheduling and grain packing in parallel processing systems
Contention-Aware Communication Schedule for High-Speed Communication
Cluster Computing
On Task Scheduling Accuracy: Evaluation Methodology and Results
The Journal of Supercomputing
Communication Contention in Task Scheduling
IEEE Transactions on Parallel and Distributed Systems
Toward a Realistic Task Scheduling Model
IEEE Transactions on Parallel and Distributed Systems
Parallel Computing - Heterogeneous 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)
Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing
IEEE Transactions on Computers
Push-Pull: Deterministic Search-Based DAG Scheduling for Heterogeneous Cluster Systems
IEEE Transactions on Parallel and Distributed Systems
Compaction of Schedules and a Two-Stage Approach for Duplication-Based DAG Scheduling
IEEE Transactions on Parallel and Distributed Systems
NP-complete scheduling problems
Journal of Computer and System Sciences
Scheduling tasks and communications on a hierarchical system with message contention
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part II
The Journal of Supercomputing
Extending Amdahl's law and Gustafson's law by evaluating interconnections on multi-core processors
The Journal of Supercomputing
A path priority-based task scheduling algorithm for heterogeneous distributed systems
International Journal of Communication Networks and Distributed Systems
| Hi-index | 0.00 |
Finding an efficient schedule for a task graph on several processors is a trade-off between maximising concurrency and minimising interprocessor communication. Task duplication is a technique that has been employed to reduce or avoid interprocessor communication. Certain tasks are duplicated on several processors to produce the data locally and avoid the communication among processors. Most of the algorithms using task duplication have been proposed for the classic scheduling model, which allows concurrent communication and ignores contention for communication resources. It is increasingly recognised that this classic model is unrealistic and does not permit creating accurate and efficient schedules. The recently proposed contention model introduces contention awareness into task scheduling by assigning the edges of the task graph to the links of the communication network. It is intuitive that scheduling under such a model benefits even more from task duplication, yet no such algorithm has been proposed as it is not trivial to duplicate tasks under the contention model. This paper proposes a contention-aware task duplication scheduling algorithm. We investigate the fundamentals for task duplication in the contention model and propose an algorithm that is based on state-of-the-art techniques found in task duplication and contention-aware algorithms. An extensive experimental evaluation demonstrates the significant improvements to the speedup of the produced schedules.