Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
Scheduling parallel program tasks onto arbitrary target machines
Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
A threshold scheduling strategy for Sisal on distributed memory machines
Journal of Parallel and Distributed Computing
A Scalable Scheduling Scheme for Functional Parallelism on Distributed Memory Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Allocating Task Interaction Graphs to Processors in Heterogeneous Networks
IEEE Transactions on Parallel and Distributed Systems
Optimal Scheduling Algorithm for Distributed-Memory Machines
IEEE Transactions on Parallel and Distributed Systems
A task duplication based scalable scheduling algorithm for distributed memory systems
Journal of Parallel and Distributed Computing
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Building Synthetic Parallel Programs: the Project ALPES
Proceedings of the IFIP WG 10.3 Workshop on Programming Environments for Parallel Computing
A Static Scheduling Heuristic for Heterogeneous Processors
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
Task scheduling algorithms for distributed memory systems
Task scheduling algorithms for distributed memory systems
A New Approach to Scheduling Parallel Programs Using Task Duplication
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
Improving Scheduling of Tasks in a Heterogeneous Environment
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Dynamic, capability-driven scheduling of DAG-based real-time jobs in heterogeneous clusters
International Journal of High Performance Computing and Networking
Low power scheduling of DAGs to minimize finish times
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Energy-Aware Scheduling Algorithm with Duplication on Heterogeneous Computing Systems
GRID '12 Proceedings of the 2012 ACM/IEEE 13th International Conference on Grid Computing
Stochastic DAG scheduling using a Monte Carlo approach
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Optimal scheduling of tasks represented by a directed acyclic graph (DAG) onto a set of homogeneous processors is a strong NP-hard problem. In this paper, we introduce a scalable scheduling scheme called STDS for heterogeneous systems. This implies that tasks could potentially have different run times on different processors. The complexity of STDS is. (V 2) where v is the number of nodes in the task graph. Schedule length is primarily reduced by selected task duplication. Current task duplication based scheduling schemes are mostly done for homogeneous systems. Comparing the performance of STDS with BIL, another scheduling scheme for heterogeneous systems, it is observed that STDS obtained speed-ups of 6 to 40 generating shorter schedules when sufficient duplication can be carried out.