Task Scheduling In Network Parallel Computing Environment

摘要

Task scheduling is one of the most challenging problems in parallel and distributed computing. This paper describes a scheduling algorithm (STF) that maps task synchronization graph (TSG) onto a cluster which is composed of some idle network workstations in a LAN for parallel computing. A special parallel program model TSG is introduced to solve synchronous cooperating working problem among coarse-grained tasks in message passing system. Our study indicates that STF algorithm can reduce the completion time of the parallel program.