DATA REARRANGING METHOD

摘要

PROBLEM TO BE SOLVED: To eliminate the need of a copy in data re-distribution while a program is executed and to speed up the execution of the program in a distributed storage-type or distributed common storage-type parallel machine. SOLUTION: A data distribution form showing the allocation method of respective array elements to a distributed memory is collected (form collection part 103). Respective arrays are divided into sets formed of partial arrays belonging to a unique processor in any data distribution form (array thinning part 105). The number of the dimensions of the original array is increased so that the array elements in the respective partial arrays become continuous addresses and the order of the array elements is rearranged (array high-dimension forming part 106). It is judged that the number of the types of the data distribution forms in the respective dimensions of array is not more than two (form type number judgement 104). It is detected that a loop control variable is contained in the added character of the dimension which is made to be higher in array and a loop having the loop control variable is converted into plural loops nested in accordance with the forming of the array dimension to be high (loop conversion par 1071). The array added character in an array reference point in a program is changed in accordance with the forming of the array dimension of array added character at an array reference point in a program to be high (added character change part 1072).