Matrix Transpose on Meshes: Theory and Practice

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

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

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

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Kaufmann, M., Meyer, U., & Sibeyn, J. F. (1997). Matrix Transpose on Meshes: Theory and Practice. Computers and Artificial Intelligence, 16(2), 107-140.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-3952-7

要旨

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.