To the role of decomposition strategy in high parallel algorithms

Abstract

Describes the important role of decomposition strategy in parallel computing, and its influence is illustrated with the example of a very frequently used parallel algorithm for matrix multiplication. On the basis of the performed analysis of the parallel computers used worldwide divides them into the two basic groups which are considered from the programmer‐developer point of view to be very different. They also introduce the typical principal structures for both these groups of parallel computers and also their models. The paper then in an illustrative way describes the development of concrete parallel algorithm for matrix multiplication on various parallel systems. For each individual practical implementation of matrix multiplication there is introduced the derivation of its calculation complexity. The individual ways of developing parallel matrix multiplication and their implementations are compared, analysed and discussed from the point of view of the programmer‐developer and user. The very important role of the decomposition strategies that are mainly of the class of asynchronous parallel computers is highlighted.