multi-round scheduling for divisible loads on the heterogeneous cluster systems of multi-core computers
By allowing the overlap execution of computation and communication, a multi-round algorithm with inter-node scheduling and intra-node scheduling for divisible loads is presented on the heterogeneous cluster systems of multi-core computers, which have different number of processing cores and distinct computation, communication and memory abilities. The presented inter-node scheduling can accommodate dynamicaly the surplus of the remaining available memory of nodes in each round scheduling, and the intra-node scheduling can efficiently make use of the characterictics of multi-core machines and the shared L2 cache to reduce the required time to access memory. The experiment results with different tests and several parameters on a heterogeneous cluster system with multi-core computers show that the presented algorithm can obtain better scheduling performance and reduce significantly the total scheduling length, and it can schedule more large-scale applications than the existing scheduling scheme.
divisible loads heterogeneous cluster systems multi-core computers shared l2 cache task scheduling multilevel cache limited memory