Matrix transpose on meshes: theory and practice

Author

Kaufmann, Michael ; Meyer, Ulrich ; Sibeyn, Jop E.

Author_Institution

Wilhelm-Schickard-Inst. fur Inf., Tubingen Univ., Germany

fYear

1997

fDate

1-5 Apr 1997

Firstpage

315

Lastpage

319

Abstract

Matrix transpose is a fundamental communication operation which is not dealt with optimally by general purpose routing schemes. For two dimensional meshes, the first optimal routing schedule is given. The strategy is simple enough to be implemented, but details of the available hardware are not favorable. However, alternative algorithms, designed along the same lines, give an improvement on the Intel Paragon

Keywords

matrix algebra; multiprocessor interconnection networks; network routing; parallel algorithms; parallel machines; 2D meshes; Intel Paragon; algorithms; communication operation; matrix transpose; optimal routing schedule; Concurrent computing; Equations; Linear algebra; Parallel machines; Routing; Wire;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing Symposium, 1997. Proceedings., 11th International

Conference_Location

Genva

ISSN

1063-7133

Print_ISBN

0-8186-7793-7

Type

conf

DOI

10.1109/IPPS.1997.580918

Filename

580918

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3414763