Towards an architecture-independent analysis of parallel algorithms
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Scheduling parallel program tasks onto arbitrary target machines
Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
IEEE Transactions on Software Engineering
Introduction to parallel computing
Introduction to parallel computing
Using random task graphs to investigate the potential benefits of heterogeneity in parallel systems
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
IEEE Transactions on Parallel and Distributed Systems
On Exploiting Task Duplication in Parallel Program Scheduling
IEEE Transactions on Parallel and Distributed Systems
Linear-time computability of combinatorial problems on series-parallel graphs
Journal of the ACM (JACM)
Solving Linear Algebraic Equations on an MIMD Computer
Journal of the ACM (JACM)
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
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
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
IEEE Transactions on Parallel and Distributed Systems
DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
LDBS: A Duplication Based Scheduling Algorithm for Heterogeneous Computing Systems
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Triplet: A Clustering Scheduling Algorithm for Heterogeneous Systems
ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
Compaction of Schedules and a Two-Stage Approach for Duplication-Based DAG Scheduling
IEEE Transactions on Parallel and Distributed Systems
SPDP '94 Proceedings of the 1994 6th IEEE Symposium on Parallel and Distributed Processing
Multiprocessor scheduling with interprocessor communication delays
Operations Research Letters
Parallel partitioning for distributed systems using sequential assignment
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
A complex computing problem may be efficiently solved on a system with multiple processing elements by dividing its implementation code into several tasks or modules that execute in parallel. The modules may then be assigned to and scheduled on the processing elements so that the total execution time is minimum. Finding an optimal schedule for parallel programs is a non-trivial task and is considered to be NP-complete. For heterogeneous systems having processors with different characteristics, most of the scheduling algorithms use greedy approach to assign processors to the modules. This paper suggests a novel approach called constrained earliest finish time (CEFT) to provide better schedules for heterogeneous systems using the concept of the constrained critical paths (CCPs). In contrast to other approaches used for heterogeneous systems, the CEFT strategy takes into account a broader view of the input task graph. Furthermore, the statically generated CCPs may be efficiently scheduled in comparison with other approaches. The experimentation results show that the CEFT scheduling strategy outperforms the well-known HEFT, DLS and LMT strategies by producing shorter schedules for a diverse collection of task graphs.