Automatic support for data distribution on distributed memory multiprocessor systems

Dynamic Data Partitioning for Distributed-Memory Multicomputers

“…Chapman, Fahringer, and Zima have noted that there are many known good data distributions for important numerical problems that are frequently used [6]. They describe the design of a distribution tool that makes use of performance prediction methods when possible, but also heuristically uses empirical performance data when available.…”

“…This is accomplished in O (V 2 ) time 6 (where V is now the number of vertices in the phase transition graph) using Dijkstra's single source shortest path algorithm [38]. After the shortest path has been computed, the loop peeling performed on the PTG can be seen to be necessary to obtain the best solution if the peeled iteration has a different transition sequence than the remaining iterations.…”

An automatic data distribution generator for distributed memory machines

“…An automatic tool has been proposed for implementation within the Vienna Fortran Compilation System, or VFCS [15]. The tool will rely heavily on heuristics in making distribution decisions, including data redistribution, and uses both program analysis and knowledge-based techniques.…”

Automatic selection of dynamic data partitioning schemes for distributed-memory multicomputers

“…Chapman, Fahringer, and Zima have noted that there are many known good data distribu tions for important numerical problems that are frequently used [6]. They describe the design of a distribution tool that makes use of performance prediction methods when possible, but also heuristically uses empirical performance data when available.…”

“…For reference, the functions for an Intel Paragon and a Thinking Machines CM-5, corresponding to the communication primitives used in the edge weights, are shown in Table 1. 3T here is at m ost only one edge between two nodes for each array referenced in the statem en t. For m ultiple references using th e sam e array, th e edge weight is the sum of till com m unication for th at array. 6 (a) 100.000000 * (P2 > 1) * Shift(510.000000) (b) 3100.000000 * Transfer(510.000000) 4. The maximum cut is used to select the phase split; if there is more than one cut with the same maximum value, choose the first.…”