Issue No.02 - February (1990 vol.39)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.45206
<p>A large class of data parallel computations is characterized by a sequence of phases, with phase changes occurring unpredictably. Dynamic remapping of the workload to processors may be required to maintain good performance. The problem considered, for which the utility of remapping and the future behavior of the workload are uncertain, arises when phases exhibit stable execution requirements during a given phase, but requirements change radically between phases. For these situations, a workload assignment generated for one phase may hinder performance during the next phase. This problem is treated formally for a probabilistic model of computation with at most two phases. The authors address the fundamental problem of balancing the expected remapping performance gain against the delay cost, and they derive the optimal remapping decision policy. The promise of the approach is shown by application to multiprocessor implementations of an adaptive gridding fluid dynamics program and to a battlefield simulation program.</p>
optimal dynamic remapping; data parallel computations; performance; workload assignment; probabilistic model; multiprocessor implementations; adaptive gridding fluid dynamics program; battlefield simulation program; military computing; parallel processing; performance evaluation; physics computing.
D.M. Nicol, P.F. Reynolds, Jr., "Optimal Dynamic Remapping of Data Parallel Computations", IEEE Transactions on Computers, vol.39, no. 2, pp. 206-219, February 1990, doi:10.1109/12.45206