Sökning: onr:"swepub:oai:DiVA.org:kth-91065" >
Algorithms for Matr...
Algorithms for Matrix Transposition on Boolean N-Cube Configured Ensemble Architectures
-
- Johnsson, Lennart (författare)
- KTH,Parallelldatorcentrum, PDC
-
Ho, Ching-Tien (författare)
-
(creator_code:org_t)
- Society for Industrial & Applied Mathematics (SIAM), 1988
- 1988
- Engelska.
-
Ingår i: SIAM Journal on Matrix Analysis and Applications. - : Society for Industrial & Applied Mathematics (SIAM). - 0895-4798 .- 1095-7162. ; 9:3, s. 419-454
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas