The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Glypnir—a programming language for Illiac IV
Communications of the ACM
Implementation of Data Manipulating Functions on the STARAN Associative Processor
Proceedings of the Sagamore Computer Conference on Parallel Processing
Programmable Radar Signal Processing Using the Rap
Proceedings of the Sagamore Computer Conference on Parallel Processing
CFD — A FORTRAN-like language for the ILLIAC IV
Proceedings of the conference on Programming languages and compilers for parallel and vector machines
Computer organization and algorithms for very-high speed computations.
Computer organization and algorithms for very-high speed computations.
A taxonomy of parallel sorting
ACM Computing Surveys (CSUR)
Rearrangeability of multistage shuffle/exchange networks
ISCA '87 Proceedings of the 14th annual international symposium on Computer architecture
A Parallel Time/Hardware Tradeoff T.H=O(2/sup n/2/) for the Knapsack Problem
IEEE Transactions on Computers
Universality of iterated networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Minimizing Communication in the Bitonic Sort
IEEE Transactions on Parallel and Distributed Systems
Classification Categories and Historical Development of Circuit Switching Topologies
ACM Computing Surveys (CSUR)
ACM Transactions on Programming Languages and Systems (TOPLAS)
An emulator network for SIMD machine interconnection networks
ISCA '79 Proceedings of the 6th annual symposium on Computer architecture
Study of multistage SIMD interconnection networks
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Multiprocessor hardware: An architectural overview
ACM '80 Proceedings of the ACM 1980 annual conference
Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithms
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Notes on Shuffle/Exchange-Type Switching Networks
IEEE Transactions on Computers
The Universality of the Shuffle-Exchange Network
IEEE Transactions on Computers
The Reverse-Exchange Interconnection Network
IEEE Transactions on Computers
Simulating the bitonic sort using P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
Bitonic sort on a chained-cubic tree interconnection network
Journal of Parallel and Distributed Computing
| Hi-index | 0.01 |
SIMD machine architects must choose an interconnection network to provide interprocessor communication. The universality of a network is its ability to simulate arbitrary interconnections of the processing elements. We examine the universality of five particular networks which cover the types used in the Illiac IV, STARAN, Omen, SIMDA, and RAP machines. They also cover the types discussed by Feng, Lang, Lawrie, Orcutt, Siegel, and Stone. We give O((log2N)2) algorithms, where N is the number of processing elements, for the Perfect Shuffle, PM21, WPM21, and Cube networks to simulate arbitrary interconnections (Orcutt has given an O(N1/2log2N) algorithm for the Illiac network). We analyze Batcher's bitonic sorting method and show how each network can implement it on an SIMD machine. We discuss how sorting destination tags is equivalent to simulating interconnections.