A new interconnection network for SIMD computers: The sigma network

Journal Article · Wed Jul 01 04:00:00 EDT 1987 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/TC.1987.1676976· OSTI ID:5768155

Seznec, A

When processing vectors on SIMD computers, some data manipulations (rearrangement, expansion, compression, perfect-shuffle, bit-reversal) have to be performed by an inter-connection network. When this network lacks an efficient routing control, it becomes the bottleneck for performance. It has been pointed out that general algorithms to control rearrangeable networks for arbitrary permutations are time consuming. To overcome this difficulty, Lenfant proposed a set of permutations covering standard needs associated with efficient control algorithms for the Benes network. But to perform explicit permutations on vectors, several passes through the network are necessary because they have to be composed with transfer rearrangements. The author presents efficient control algorithms to perform these vector permutations in a single pass on a new interconnection network.

• Research Organization: IRISA, 35042 Rennes Cedex
• OSTI ID: 5768155
• Journal Information: IEEE Trans. Comput.; (United States), Journal Name: IEEE Trans. Comput.; (United States) Vol. C-36:7; ISSN ITCOB
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
COMMUNICATIONS
COMPUTER NETWORKS
CONTROL
DATA PROCESSING
DATA TRANSMISSION
MATHEMATICAL LOGIC
PERFORMANCE
PROCESSING
PROGRAMMING
TENSORS
VECTOR PROCESSING
VECTORS