Change search
ReferencesLink to record
Permanent link

Direct link
The Complexity of Reshaping Arrays on Boolean Cubes
KTH, School of Computer Science and Communication (CSC), Centres, Centre for High Performance Computing, PDC. (Parallelldatorcentrum)
1990 (English)Conference paper (Refereed)
Abstract [en]

Reshaping ofarrays is a convenient programming primitive. For arrays encoded in a binary-reflected Gray code reshaping implies code change. We show that an axis splitting, or combining of two axes, requires communica tion in exactly one dimension, and that for multiple axes split tings the exchanges in the different dimensions can be ordered arbitrarily. The nnmber of element transfers in sequence is independent of the number of dimensions requiring coniniunication for large local data sets, and concurrent conuiiunication. The lowerboundfor the number of element transfers in sequence is $with K elements perprocessor. We present algorithius that is of this complexity for some cases, and of complexity K in the worstcase. Conversion between binary code and binary-reflected Gray code is a special case of reshaping.

Place, publisher, year, edition, pages
1990. 370-377 p.
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-65538DOI: 10.1109/DMCC.1990.555408OAI: diva2:483437
The Fifth Distributed Memory Computing Conference
NR 20140805Available from: 2012-01-25 Created: 2012-01-25Bibliographically 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: 17 hits
ReferencesLink to record
Permanent link

Direct link