|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks
July 1986 (vol. 35 no. 7)
pp. 591-601
| ASCII Text | x | ||
| null Shing-Tsaan Huang, S.K. Tripathi, "Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks," IEEE Transactions on Computers, vol. 35, no. 7, pp. 591-601, July, 1986. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1986.1676800, author = {null Shing-Tsaan Huang and S.K. Tripathi}, title = {Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks}, journal ={IEEE Transactions on Computers}, volume = {35}, number = {7}, issn = {0018-9340}, year = {1986}, pages = {591-601}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1986.1676800}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks IS - 7 SN - 0018-9340 SP591 EP601 EPD - 591-601 A1 - null Shing-Tsaan Huang, A1 - S.K. Tripathi, PY - 1986 KW - tightly coupled multiprocessors KW - Finite permutation machine KW - interconnection network KW - permutation network KW - shuffle KW - SIMD KW - stack permutation machine VL - 35 JA - IEEE Transactions on Computers ER - | |||
In this paper, we present a new model, finite permutation machine (FPM), to describe the permutation networks. A set of theorems are developed to capture the theory of operations for the permutation networks. Using this new framework, an interesting problem is attacked: are 2n - 1 passes of shuffle exchange necessary and sufficient to realize all permutations? where n = log2 N and N is the number of inputs and outputs interconnected by the network. We prove that to realize all permutations, 2n - 1 passes of shuffle exchange are necessary and that 3n - 3 passes are sufficient. This reduces the sufficient number of passes by 2 from the best-known result.
Index Terms:
tightly coupled multiprocessors, Finite permutation machine, interconnection network, permutation network, shuffle, SIMD, stack permutation machine
Citation:
null Shing-Tsaan Huang, S.K. Tripathi, "Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks," IEEE Transactions on Computers, vol. 35, no. 7, pp. 591-601, July 1986, doi:10.1109/TC.1986.1676800
Usage of this product signifies your acceptance of the Terms of Use.