Run-time scheduling and execution of loops on message passing machines
Joel Haskin Saltz, Kathleen Crowley, Ravi Mirchandaney, Harry Berryman · Journal of Parallel and Distributed Computing · 1990
We examine the effectiveness of optimizations aimed to allowing distributed machine to efficiently compute inner loops over globally defined data structures. Our optimizations are specifically targeted toward loops in which some array references are made through a level of indirection. Unstructured mesh codes and sparse matrix solvers are examplese of programs with kernels of this sort. Experimental data that quantify the performance obtainable using the methods discussed here are included.