AbstractGiven a rectangular m×n matrix stored as a two-dimensional array, we want to transpose it in place and measure the cost by the number of memory writes and the number of auxiliary cells used. We propose a transposition algorithm with optimal complexity O(mn) using only min(m,n) auxiliary memory cells
One obstacle to running very large two- and three-dimensional codes on the Cray X-MP and Y-MP system...
AbstractThis paper contains the first concrete lower bound argument for Turing machines with one wor...
Matrix transposition is an important algorithmic building block for many numeric algorithms like m...
This paper presents implementations of in‐place algorithms for transposing rectangular matrices. One...
This thesis presents a novel algorithm for Transposing Rectangular matrices In-place and in Parallel...
We describe a decomposition for in-place matrix transposi-tion, with applications to Array of Struct...
International audienceModern computers keep following the traditional model of addressing memory lin...
The mesh is an architecture that has many scientific applications, and matrix transpose is an import...
We develop a prototype library for in-place (dense) matrix storage for-mat conversion between the ca...
We consider the problem of matrix transpose on mesh-connected processor networks. On the theoretical...
Eklundh's (1972) algorithm to transpose a large matrix stored on an external device such as a disc h...
AbstractA series of existing lower bound results for deterministic one-tape Turing machines is exten...
AbstractWe give nearly optimal algorithms for matrix transpose on meshes with wormhole and XY routin...
Transposing an N × N array that is distributed row- or column-wise across P = N processors is a fund...
The correctness of an in-place permutation algorithm is proved. The algorithm exchanges elements bel...
One obstacle to running very large two- and three-dimensional codes on the Cray X-MP and Y-MP system...
AbstractThis paper contains the first concrete lower bound argument for Turing machines with one wor...
Matrix transposition is an important algorithmic building block for many numeric algorithms like m...
This paper presents implementations of in‐place algorithms for transposing rectangular matrices. One...
This thesis presents a novel algorithm for Transposing Rectangular matrices In-place and in Parallel...
We describe a decomposition for in-place matrix transposi-tion, with applications to Array of Struct...
International audienceModern computers keep following the traditional model of addressing memory lin...
The mesh is an architecture that has many scientific applications, and matrix transpose is an import...
We develop a prototype library for in-place (dense) matrix storage for-mat conversion between the ca...
We consider the problem of matrix transpose on mesh-connected processor networks. On the theoretical...
Eklundh's (1972) algorithm to transpose a large matrix stored on an external device such as a disc h...
AbstractA series of existing lower bound results for deterministic one-tape Turing machines is exten...
AbstractWe give nearly optimal algorithms for matrix transpose on meshes with wormhole and XY routin...
Transposing an N × N array that is distributed row- or column-wise across P = N processors is a fund...
The correctness of an in-place permutation algorithm is proved. The algorithm exchanges elements bel...
One obstacle to running very large two- and three-dimensional codes on the Cray X-MP and Y-MP system...
AbstractThis paper contains the first concrete lower bound argument for Turing machines with one wor...
Matrix transposition is an important algorithmic building block for many numeric algorithms like m...
DOI
Add to ORKG