English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Matrix Transpose on Meshes: Theory and Practice

MPS-Authors
/persons/resource/persons44745

Kaufmann,  Michael
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45038

Meyer,  Ulrich
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Sibeyn,  Jop F.
Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Kaufmann, M., Meyer, U., & Sibeyn, J. F. (1997). Matrix Transpose on Meshes: Theory and Practice. In D. G. Feitelson, & L. Rudolph (Eds.), Proceedings of the 11th International Parallel Processing Symposium (IPPS-97) (pp. 315-319). Los Alamitos, USA: IEEE.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3954-3
Abstract
We consider the problem of matrix transpose on mesh-connected processor networks. On the theoretical side, we present the first optimal algorithm for matrix transpose on two-dimensional meshes.Then we consider issues on implementations, show that the theoretical best bound cannot be achieved and present an alternative approach that really improves the practical performance. Finally, we introduce the concept of orthogonalizations, which are generalization of matrix transposes. We show how to realize them efficiently and present interesting applications of this new technique.