Self-scheduling on distributed-memory machines
Jiang Liu, Vikram A. Saletore · 1993
We preseni a general approach of self-scheduling a non-uniform parallel loop on a distributed-memory nzachine.The approach has two phases: a static schedu!tng phase and a dynamic scheduling phase.In addition to reduce scheduling overhead, using the static scheduling phase allows the data needed by the staticallyscheduled iterations to beprefetched.The dynamic scheduling phase balances the workload.Data dastrtbution methods for setf-schedulmg are also the focus of this paper.We classify the data distribution methods into four categories and present partial duplication, a method that allows the problem size to grow ltnearly in the number of processors.The experiments conducted on a 64-node NCUBE show that as much as 79% improvement is achieved over static scheduling on the generdion of a false-color image.