Automatic Computation and Data Decomposition Algorithm Based on Dominant Value
基于主导值的计算和数据自动划分算法

Automatic computation and data decomposition are an optimization technique that distributes computations and data onto different processors. The decomposition result has a direct impact on the performance of program's paral- lelization. Array is one of main targets of treatment for the decomposition algorithm, and some profits of them are not e- nough after parallclization, but it will bring constraints and disrupt the other distribution of array, leading to large a- mounts communication of data re-distribution. The decomposition algorithm in existing has no agreement in the order of array distribution, therefore can't restrict propagation of constraint of array' s parallelization, reducing performance of optimized parallel code automatically generated by the back-end compiler. This paper presented an automatic computa- tion and data decomposition based on the dominant values. Algorithm quantified the impact of array on the programs' parallelism as the dominant value, and agreed priorities of distribution based on the size of the dominant values of array, limited the spread speed of constraints of interference array, improved the reasonableness of decomposition results. Ex- perimental results show that the algorithm can get good decomposition results.