This paper addresses the problem of scheduling a parallel program represented by a directed acyclic task graph onto homogeneous cluster systems to minimize its execution time. Many sub-optimal algorithms have been proposed that promises acceptable running time but not optimal solutions. We propose an algorithm that guarantees optimal solutions but not acceptable running time. Experiments show that in many practical cases the proposed algorithm performs very effectively in comparison with sub-optimal algorithms while still getting the optimal solutions. © Springer-Verlag 2004.
CITATION STYLE
Xie, X., Yao, W., & You, J. (2004). An optimal task scheduling for cluster systems using task duplication. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3033, 863–870. https://doi.org/10.1007/978-3-540-24680-0_136
Mendeley helps you to discover research relevant for your work.