| 摘要 |
PROBLEM TO BE SOLVED: To execute data transfer which makes the whole data to be transferred exist on the whole memories in the shortest time. SOLUTION: This data transfer method performs one side transfer and mutual transfer with other computers and is performed by a parallel computer that consists of plural computers provided with a memory and performs the fastest data transfer by performing mutual transfer two times after performing one side transfer two times at the time of transferring data so as to be stored in the whole computers, for instance, when data D(1) is stored is M(12) among computers 1 to 16 (memories M(1) to M(16)), D(2) in M(10), D(3) in M(11) and D(4) in M(12). Generally, when there are M computers (however, M is the power of 2) and D pieces (however, 1<D<M and D is a divisor of M) of data to be transferred, the mutual transfer is performed (logM/logD) times after the one side transfer is performed (logD/log2) times. |
