Algorithms for Matrix Transposition on Boolean Cube Configured Ensemble Architectures
1987 (English)Conference paper (Refereed)
In a multiprocessor with distributed storage the data structures have a significant impact on the communication complexity. In this paper we present a few algorithms for performing matrix transposition on a Boolean $n$-cube. One algorithm performs the transpose in a time proportional to the lower bound both with respect to communication start-ups and to element transfer times. We present algorithms for transposing a matrix embedded in the cube by a binary encoding, a binary-reflected Gray code encoding of rows and columns, or combinations of these two encodings. The transposition of a matrix when several matrix elements are identified to a node by consecutive or cyclic partitioning is also considered and lower bound algorithms given. Experimental data are provided for the Intel iPSC and the Connection Machine.
Place, publisher, year, edition, pages
1987. 621-629 p.
matrix transpose, Boolean cubes, personalized communication, routing, data encoding
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-65577OAI: oai:DiVA.org:kth-65577DiVA: diva2:483511
The 1987 International Conference on Parallel Processing
NR 201408052012-01-252012-01-252016-05-30Bibliographically approved