Proceedings of the 1992 ACM/IEEE conference on Supercomputing
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
Task Clustering and Scheduling for Distributed Memory Parallel Architectures
IEEE Transactions on Parallel and Distributed Systems
On Exploiting Task Duplication in Parallel Program Scheduling
IEEE Transactions on Parallel and Distributed Systems
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
Link contention-constrained scheduling and mapping of tasks
Cluster Computing
IEEE Transactions on Parallel and Distributed Systems
On the Granularity and Clustering of Directed Acyclic Task Graphs
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
IEEE Transactions on Parallel and Distributed Systems
Improving Scheduling of Tasks in a Heterogeneous Environment
IEEE Transactions on Parallel and Distributed Systems
ISPDC '04 Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
NP-complete scheduling problems
Journal of Computer and System Sciences
Scheduling parallel tasks onto NUMA multiprocessors with inter-processor communication overhead
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
The Iso-level scheduling heuristic for heterogeneous processors
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Process Scheduling in Heterogeneous Multiprocessor Systems Using Task Duplication
International Journal of Business Data Communications and Networking
Hi-index | 0.00 |
This paper proposes a compiler-time scheduling algorithm, called the Dynamic Critical Path Duplication (DCPD) scheduling algorithm, to exploit all of a program's available parallelism in distributed heterogeneous computing systems. This algorithm could exploit the potential of parallel processing, allowing for system heterogeneities and network bandwidth. It is compared favorably with other related proposed algorithms. Experimental results show its superiority.