Computation and Data Decomposition Algorithm Supporting Data Reorganization Communication
Dong Chunli, Rongcai Zhao, Lin Han, Ya Zhang · Jisuanji gongcheng · 2007
Minimizing communication by increasing the locality of data references is an important optimization for achieving high performance on large-scale parallel machines,but reorganization is inevitable in the progress of decomposition.It is important to find a method to solve the problem.This paper describes a linear decomposition algorithm which finds computation and data decomposition automatically,including finding data and computations decomposition that has data reorganization communication.