
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S.T. Huang, S.K. Tripathi, "SelfRouting Technique in PerfectShuffle Networks Using Control Tags," IEEE Transactions on Computers, vol. 37, no. 2, pp. 251256, February, 1988.  
BibTex  x  
@article{ 10.1109/12.2159, author = {S.T. Huang and S.K. Tripathi}, title = {SelfRouting Technique in PerfectShuffle Networks Using Control Tags}, journal ={IEEE Transactions on Computers}, volume = {37}, number = {2}, issn = {00189340}, year = {1988}, pages = {251256}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.2159}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  SelfRouting Technique in PerfectShuffle Networks Using Control Tags IS  2 SN  00189340 SP251 EP256 EPD  251256 A1  S.T. Huang, A1  S.K. Tripathi, PY  1988 KW  unscrambling; set intersections; computational complexity; permutation networks; multiprocessor interconnection networks; control tags; selfrouting technique; multiplepass perfectshuffle networks; bitpermutecomplement permutations; inverseomegarealizing sets; computational complexity; multiprocessor interconnection networks; set theory. VL  37 JA  IEEE Transactions on Computers ER   
[1] V. Benes,Mathematical Theory of Connecting Networks. New York: Academic, 1965.
[2] L. Cannon, "A cellular computer to implement the Kalman filter algorithm," Ph.D. dissertation, Montana State Univ., Bozeman, 1969.
[3] E. Dekel, D. Nassimi, and S. Sahni, "Parallel matrix and graph algorithms," inProc 17th Annu. Allerton Conf. Commun., Contr., Comput., Oct. 1979, pp. 2736.
[4] P. M. Flanders, "A unified approach to a class of data movements on an array processor,"IEEE Trans. Comput., vol. C31, pp. 809819, Sept. 1982.
[5] I. N. Herstein,Topics in Algebra. Lexington MA: Xerox College, 1964.
[6] T. Huang, "On shuffleexchange type interconnection networks for multiprocessor systems," Ph.D. dissertation, Univ. Maryland, 1985.
[7] 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.
[8] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C24, pp. 11451155, Dec. 1975.
[9] J. Lenfant, "Parallel permutations of data: A Benes network control algorithm for frequently used for permutations,"IEEE Trans. Comput., vol. C27, pp. 637647, July 1978.
[10] J. Lenfant and S. Tahe, "Permuting data with the omega network,"Acta Informatica, vol. 21, pp. 629641, 1985.
[11] D. Nassimi and S. Sahni, "An optimal routing algorithm for meshconnected parallel computer,"J. ACM, vol. 27, pp. 629, Jan. 1980.
[12] D. Nassimi and S. Sahni, "A selfrouting Benes network and parallel permutation algorithms,"IEEE Trans. Comput., vol. C30, pp. 332 340, May 1981.
[13] M. C. Pease, "The indirect binaryncub microprocessor array,"IEEE Trans. Comput., vol. C26, pp. 458473, May 1977.
[14] H. J. Siegel, "The theory underlying the partitioning of permutation networks,"IEEE Trans. Comput., vol. C29, pp. 791801, Sept. 1980.
[15] D. Steinberg, "Invariant properties of the shuffleexchange and a simplified costeffective version of the omega network,"IEEE Trans. Comput., vol. C32, pp. 444450, May 1983.
[16] H. S. Stone, "Parallel processing with perfect shuffle,"IEEE Trans. Comput., vol. C20, pp. 153161, Feb. 1971.
[17] C. Wu and T. Feng, "Universality of the shuffleexchange network,"IEEE Trans. Comput., vol. C30, pp. 324331, May 1981.
[18] P. C. Yew and D. H. Lawrie, "An easily controlled network for frequently used permutations,"IEEE Trans. Comput., vol. C30, pp. 296298, Apr. 1981.