An algorithm for coscheduling tasks on network of heterogeneous workstations
Wu Yan-Hui, LU Xinda, Zeng Zhi-Yong · 2003
An algorithm is proposed, which solves cooperative concurrent computing tasks by using the idle cycle of a number of high performance heterogeneous workstations interconnected by a high-speed network. In order to get better parallel computation performance, this paper gives a model and an algorithm of task scheduling among heterogeneous workstations, in which the costs of loading data, computing, communication and collecting results are considered. Using this efficient algorithm, an optimal subset of heterogeneous workstations with the shortest parallel execution time of tasks can be selected.