Dynamic scheduling on a PC cluster
Janez Brest, Viljem Zumer, Milan Ojsteršek · 1999
The goal of this work is to generate a better scheme for communicating data among subtasks during application program execution.Dynamic scheduling on a heterogeneous system -PC cluster was implemented to minimize the application program execution time.Our method decomposes the program workload into computationally homogeneous subtasks, which may be of different size, depending on the current load of each machine in a heterogeneous computer system.We present some experimental results of two practical applications.The first one is called automatic classification of words in language modeling, and the second one is the asymmetric traveling salesman problem.