This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Generalization of Eklundh's Algorithm for Transposing Large Matrices
December 1975 (vol. 24 no. 12)
pp. 1221-1226
H.K. Ramapriyan, Aerospace Systems Center, Computer Sciences Corporation
The purpose of this paper is to present an algorithm for transposing large rectangular matrices. This is basically a generalization of Eklundh's algorithm. Eklundh's method is designed to handle arrays in place of using powers-of-2 approach wherein partitions of the matrix have dimensions which are powers of 2. The algorithm presented here does not have this restriction. The choice of partitions is posed as an optimal control problem amenable to solution using Bellman's principle of optimality. The optimal partitioning of the matrix can be determined depending on the computer configuration (i.e., core size, whether moving-head or fixed-head disk drives are used, number of words per track, etc.) and the matrix dimensions. Simple modifications are noted for transposing complex/double precision and packed integer matrices. Experimental results are presented comparing the times needed for transposition using optimal partitioning and powers-of-2 partitioning. It is found in the cases tested that a speed gain of up to 5.55 is obtained by optimizing the partition sizes.
Index Terms:
Large matrices, transposition algorithm, image processing, dynamic programming, optimization.
Citation:
H.K. Ramapriyan, "A Generalization of Eklundh's Algorithm for Transposing Large Matrices," IEEE Transactions on Computers, vol. 24, no. 12, pp. 1221-1226, Dec. 1975, doi:10.1109/T-C.1975.224167
Usage of this product signifies your acceptance of the Terms of Use.