Research of Task Scheduling in NetworkParallel Computing Environment
Kai Xiong Hu, Yi Zhang, Jianping Hu · Beijing Hangkong Hangtian Daxue xuebao · 2001
Clusters of workstations on common network are much increasing being used as cost effective parallel computing platforms. Task scheduling is one of the crucial problems in cluster computing. A new scheduling graph model is developed to present a kind of special parallel program, which solves synchronous working problem among coarse grained tasks in message passing system. A scheduling algorithm that maps this kind of program onto a cluster is provided, which consists of some idle workstations in a LAN for parallel computing. It is demonstrated that algorithm can reduce the completion time of the parallel program.