Change search
ReferencesLink to record
Permanent link

Direct link
Optimal Communication Channel Utilization for Matrix Transposition and Related Permutations on Boolean Cubes
KTH, School of Computer Science and Communication (CSC), Centres, Centre for High Performance Computing, PDC. (Parallelldatorcentrum)
1994 (English)In: Journal of Discrete Applied Mathematics, Vol. 53, no 1-3, 251-274 p.Article in journal (Refereed) Published
Abstract [en]

We present optimal schedules for permutations in which each node sends one or several unique messages to every other node. With concurrent communication on all channels of every node in binary cube networks, the number of element transfers in sequence for K elements per node is K/2, irrespective of the number of nodes over which the data set is distributed. For a succession of s permutations within disjoint subcubes of d dimensions each, our schedules yield min(K/2 + (s - 1)d, (s + 3)d, K/2 + 2d) exchanges in sequence. The algorithms can be organized to avoid indirect addressing in the intermode data exchanges, a property that increases the performance on some architectures.

Place, publisher, year, edition, pages
Elsevier, 1994. Vol. 53, no 1-3, 251-274 p.
Keyword [en]
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-90989DOI: 10.1016/0166-218X(94)90189-9OAI: diva2:507639
NR 20140805Available from: 2012-03-05 Created: 2012-03-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Johnsson, Lennart
By organisation
Centre for High Performance Computing, PDC
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

Altmetric score

Total: 14 hits
ReferencesLink to record
Permanent link

Direct link