
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S.T. Huang, "Notes on Shuffle/Exchange Type Permutation Sets," IEEE Transactions on Computers, vol. 39, no. 7, pp. 962965, July, 1990.  
BibTex  x  
@article{ 10.1109/12.55699, author = {S.T. Huang}, title = {Notes on Shuffle/Exchange Type Permutation Sets}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {7}, issn = {00189340}, year = {1990}, pages = {962965}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.55699}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Notes on Shuffle/Exchange Type Permutation Sets IS  7 SN  00189340 SP962 EP965 EPD  962965 A1  S.T. Huang, PY  1990 KW  shuffle/exchange type permutation sets; intuitive operations; multiprocessor interconnection networks. VL  39 JA  IEEE Transactions on Computers ER   
Properties of some shuffle/exchange type permutation sets are studied from operational points of view. The permutation sets studied are Omega , Omega /sup 1/, Psi , L, and U; Omega and Omega /sup 1/ are, respectively, the omega and inverse omega permutation sets, Omega identical to ( Omega intersection Omega /sup 1/); and L and U are, respectively, the admissible lower and upper triangular permutation sets. Several intuitive operations are introduced. Based on these operations, important known results relating to these sets are readdressed. The recursive nature of the sets is also discussed.
[1] K. E. Batcher, "Sorting networks and their applications," inProc. AFIPS Conf., 1986, pp. 307314.
[2] S.T. Huang and S. K. Tripathi, "Finite state model and compatibility theory: New analysis tools for permutation networks,"IEEE Trans. Comput., vol. C35, no. 7, pp. 591601, July 1986.
[3] S.T. Huang and S. K. Tripathi, "Selfrouting technique in perfectshuffle networks using control tags,"IEEE Trans. Comput., vol. 37, no. 2, pp. 251256, Feb. 1988.
[4] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. 24, no. 12, pp. 11451155, Dec. 1975.
[5] J. Lenfant, "Parallel permutations of data: A Benes network control algorithm for frequently used permutations,"IEEE Trans. Comput., vol. C27, no. 7, pp. 637647, July 1978.
[6] D. Nassimi and S. Sahni, "A selfrouting Benes network and parallel permutation algorithms,"IEEE Trans. Comput., vol. C30, no. 5, pp. 332339, May 1981.
[7] D. S. Parker, "Notes on shuffle/exchangetype switching networks,"IEEE Trans. Comput., vol. C29, no. 3, pp. 213221, Mar. 1980.
[8] M. C. Pease, "The indirect binaryncube microprocessor array,"IEEE Trans. Comput., vol. C26, no. 5, pp. 458473, May 1977.
[9] D. Steinberg, "Invariant properties of the shuffleexchange and a simplified costeffective version of the Omega network,"IEEE Trans. Comput., vol. C32, no. 5, pp. 444450, May 1983.
[10] H. S. Stone, "Parallel processing with perfect shuffle,"IEEE Trans. Comput., vol. C20, pp. 153161, Feb. 1971.
[11] C. Wu and T.Y. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C29, no. 8, pp. 694702, Aug. 1980.