A dynamic critical path duplication task scheduling algorithm for distributed heterogeneous computing systems

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