Generalized Shuffle Permutations on Boolean Cubes
1992 (English)In: Journal of Parallel and Distributed Computing, ISSN 0743-7315, E-ISSN 1096-0848, Vol. 16, no 1, 1-14 p.Article in journal (Refereed) Published
In a generalized permutation an address (a[subscript q-1]a[subscript q-2] ... a0 receives its content from an address obtained through a cyclic shift on a subset of the q dimensions used for the encoding of the addresses. Bit-complementation may be combined with the shift. We give an algorithm that requires K/2 + 2 exchanges for K elements per processor, when storage dimensions are part of the permutation, and concurrent communication on all ports of every processor is possible. The number of element exchanges in sequence is independent of the number of processor dimensions [omega subscript r] in the permutation.
Place, publisher, year, edition, pages
1992. Vol. 16, no 1, 1-14 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-91006DOI: 10.1016/0743-7315(92)90039-POAI: oai:DiVA.org:kth-91006DiVA: diva2:507669
NR 201408052012-03-052012-03-05Bibliographically approved