On the Number of Permutations Performable by the Augmented Data Manipulator Network
- 1 April 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (4) , 270-277
- https://doi.org/10.1109/tc.1982.1675992
Abstract
The Augmented Data Manipulator (ADM) network has been proposed as an interconnection network for SIMD machines. As one measure for comparing the ADM network to multistage cube networks, the number of distinct data permutations performable in a single pass through the ADM is examined. Techniques are given to count the number of settings of any stage of the network which are permutations. Upper and lower bounds on the number of distinct permutations performable by the network are proven.Keywords
This publication has 13 references indexed in Scilit:
- PASM: A Partitionable SIMD/MIMD System for Image Processing and Pattern RecognitionIEEE Transactions on Computers, 1981
- Using the Augmented Data Manipulator Network in PASMComputer, 1981
- The Theory Underlying the Partitioning of Permutation NetworksIEEE Transactions on Computers, 1980
- The Reverse-Exchange Interconnection NetworkIEEE Transactions on Computers, 1980
- A Model of SIMD Machines and a Comparison of Various Interconnection NetworksIEEE Transactions on Computers, 1979
- Study of multistage SIMD interconnection networksPublished by Association for Computing Machinery (ACM) ,1978
- The Indirect Binary n-Cube Microprocessor ArrayIEEE Transactions on Computers, 1977
- Analysis Techniques for SIMD Machine Interconnection Networks and the Effects of Processor Address MasksIEEE Transactions on Computers, 1977
- Data Manipulating Functions in Parallel Processors and Their ImplementationsIEEE Transactions on Computers, 1974
- Banyan networks for partitioning multiprocessor systemsPublished by Association for Computing Machinery (ACM) ,1973