Matrix Transpose for Block Allocations on Torus and de Bruijn Networks

The full text article is not available for purchase.

The publisher only permits individual articles to be downloaded by subscribers.


We present in this paper fast algorithms for the matrix transpose problem on distributed-memory parallel machines for block allocations of the matrix. We propose a general methodology based on a partitioning of the communication networks into paths or cycles for which we develop optimal algorithms for elementary pairwise exchanges. It leads to efficient algorithms for torus and de Bruijn networks. We study the lower bounds for the linear model of time for both store-and-forward and wormhole commutation modes, and we compare the execution time of our algorithms with these lower bounds.

Document Type: Research Article

Affiliations: Institut Fourier, LMC-IMAG, 100 rue des Mathematiques, Grenoble Cedex 9, 38041, France

Publication date: April 1, 1996

Related content



Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more