Change search
ReferencesLink to record
Permanent link

Direct link
Algorithms for Matrix Transposition on Boolean Cube Configured Ensemble Architectures
1987 (English)Conference paper (Refereed)
Abstract [en]

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.
Keyword [en]
matrix transpose, Boolean cubes, personalized communication, routing, data encoding
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-65577OAI: diva2:483511
The 1987 International Conference on Parallel Processing

NR 20140805

Available from: 2012-01-25 Created: 2012-01-25 Last updated: 2016-05-30Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Johnsson, Lennart
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 24 hits
ReferencesLink to record
Permanent link

Direct link