To the role of decomposition strategy in high parallel algorithms

Ivan Hanuliak (Faculty of Control and Informatics, University of Zilina, Moyzesova, Slovakia)


ISSN: 0368-492X

Publication date: 1 December 2000


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.



Hanuliak, I. (2000), "To the role of decomposition strategy in high parallel algorithms", Kybernetes, Vol. 29 No. 9/10, pp. 1042-1057.

Download as .RIS




Copyright © 2000, MCB UP Limited

Please note you might not have access to this content

You may be able to access this content by login via Shibboleth, Open Athens or with your Emerald account.
If you would like to contact us about accessing this content, click the button and fill out the form.
To rent this content from Deepdyve, please click the button.