Efficient algorithms for data distribution on distributed memory parallel computers

An investigation of data distribution in distributed memory parallel computers reveals that systems benefit from data redistribution to perform a series of Do-loops only when the communication cost of executing the Do-loops is greater than a determined threshold value. Proposed dynamic programming algorithms can establish efficient data distribution schema for Do-loops. Experimental studies demonstrate the importance of establishing the necessity for data redistribution.