Data distribution functions are introduced. They are matched with scheduling functions. The processors and iterations are determined that use an array element at its fixed position in a statement. This makes it possib...
详细信息
Data distribution functions are introduced. They are matched with scheduling functions. The processors and iterations are determined that use an array element at its fixed position in a statement. This makes it possible to obtain the initial data distribution and also information on the data volume for every processor and on the structure of required communications.
The problem of optimization of communications during the execution of a program on a parallel computer with distributed memory is investigated. Statements are formulated that make it possible to determine the possibil...
详细信息
The problem of optimization of communications during the execution of a program on a parallel computer with distributed memory is investigated. Statements are formulated that make it possible to determine the possibility of organization of data broadcast and translation. The conditions proposed are represented in the form suitable for practical application and can be used for automated parallelization of programs.
Parallel algorithms for distributed memory computers should be granular, in which case the set of algorithmic operations is split into sets known as computation grains, or tiles. Conditions are proposed and proved und...
详细信息
Parallel algorithms for distributed memory computers should be granular, in which case the set of algorithmic operations is split into sets known as computation grains, or tiles. Conditions are proposed and proved under which data is used in the same granular computation process where it was determined. These conditions can be used to estimate the number of communication operations in alternative versions of parallel algorithms.
暂无评论