Algorithms for Matrix Transposition on Boolean N-Cube Configured Ensemble Architectures
1988 (English)In: SIAM Journal on Matrix Analysis and Applications, ISSN 0895-4798, E-ISSN 1095-7162, Vol. 9, no 3, 419-454 p.Article in journal (Refereed) Published
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
1988. Vol. 9, no 3, 419-454 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-91065DOI: 10.1137/0609037OAI: oai:DiVA.org:kth-91065DiVA: diva2:507919
NR 201408052012-03-062012-03-062016-05-30Bibliographically approved