Linear-time Matrix Transpose Algorithms Using Vector Register File With Diagonal Registers
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
An Efficient Algorithm for Large-Scale Matrix Transposition
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Detection of Global Edges in Textured Images
IEEE Transactions on Computers
Comments on "A Computer Algorithm for Transposing Nonsquare Matrices"
IEEE Transactions on Computers
IEEE Transactions on Computers
A Computer Algorithm for Transposing Nonsquare Matrices
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
A Generalization of Eklundh's Algorithm for Transposing Large Matrices
IEEE Transactions on Computers
Transposition of Matrix Stored on Sequential File
IEEE Transactions on Computers
Efficient parallel out-of-core matrix transposition
International Journal of High Performance Computing and Networking
IBM Journal of Research and Development
Drug design issues on the cell BE
HiPEAC'08 Proceedings of the 3rd international conference on High performance embedded architectures and compilers
Optimizing matrix transpose on torus interconnects
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
A systolic VLSI architecture for multi-dimensional transforms
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: plenary, special, audio, underwater acoustics, VLSI, neural networks - Volume I
Efficient layout transformation for disk-based multidimensional arrays
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
More efficient oblivious transfer and extensions for faster secure computation
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Permuting data on random-access block storage
Proceedings of the VLDB Endowment
| Hi-index | 15.00 |
A method is given for transposition of 2n脳2n data matrices, larger than available high-speed storage. The data should be stored on an external storage device, allowing direct access. The performance of the algorithm depends on the size of the main storage, which at least should hold 2n+1 points. In that case the matrix has to be read in and written out n times.