
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
K. Padmanabhan, "Design and Analysis of EvenSized Binary ShuffleExchange Networks for Multiprocessors," IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 4, pp. 385397, October, 1991.  
BibTex  x  
@article{ 10.1109/71.97896, author = {K. Padmanabhan}, title = {Design and Analysis of EvenSized Binary ShuffleExchange Networks for Multiprocessors}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {2}, number = {4}, issn = {10459219}, year = {1991}, pages = {385397}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.97896}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Design and Analysis of EvenSized Binary ShuffleExchange Networks for Multiprocessors IS  4 SN  10459219 SP385 EP397 EPD  385397 A1  K. Padmanabhan, PY  1991 KW  Index Termscontrol tags; structural properties; traffic capacity; binary shuffleexchange networks;multiprocessors; architecture; performance; connectivity; distributed tagbased controlalgorithm; source; destination; dynamic properties; stochastic environment; buffercapacity; multiprocessing systems; multiprocessor interconnection networks; parallelarchitectures; performance evaluation VL  2 JA  IEEE Transactions on Parallel and Distributed Systems ER   
The architecture and performance of binary shuffleexchange networks of any size are investigated. It is established that a network with a shuffleexchange stages whose number equals the least integer (or=log/sub 2/N) or a single recirculating stage can provide the connectivity between N inputs and N outputs using a distributed tagbased control algorithm. Control tags depend on both source and destination when N is not a power of two and can be computed in a simple manner. Several structural and dynamic properties of the network are established, contrasting the behavior of the poweroftwo and composite sized systems. The performance of the network in a stochastic environment is investigated analytically. It is shown that the shuffleexchange networks behave in much the same way with respect to traffic and buffer capacity regardless of whether the system size is a power of two or not.
[1] P.Y. Chen, P.C. Yew, and D. H. Lawrie, "Performance of packet switching in buffered singlestage shuffleexchange networks," inProc. 3rd Int. Conf. Distributed Comput., May 1982, pp. 622627.
[2] D. Z. Du and F. K. Hwang, "Generalized de Bruijn digraphs,"Networks, vol. 18, pp. 2738, 1988.
[3] I. Gazit and M. Malek, "On the number of permutations performable by extrastage multistage interconnection networks," inProc. 1987 Int. Conf. Parallel Processing, Aug. 1987, pp. 461470.
[4] L. R. Goke and G. J. Lipovski, "Banyan networks for partitioning multiprocessor systems," inProc. 1st Annu. Symp. Comput. Architecture, Dec. 1973, pp. 2128.
[5] S. W. Golomb, "Permutations by cutting and shuffling,"SIAM Rev., vol. 3, no. 4, pp. 293297, Oct. 1961.
[6] M. Imase and M. Itoh, "Design to minimize diameter on buildingblock network,"IEEE Trans. Comput., vol. C30, pp. 439442, June 1981.
[7] L. Kleinrock,Queueing Systems, Vol. 1. New York: Wiley, 1975, ch. 5.
[8] C. P. Kruskal and M. Snir, "The performance of multistage interconnection networks for multiprocessors,"IEEE Trans. Comput., vol. C32, pp. 10911098, Dec. 1983.
[9] C. P. Kruskal and M. Snir, "A unified theory of interconnection network structure,"Theoret. comput. Sci., vol. 48, pp. 7594, 1986.
[10] T. Lang, "Interconnections between processors and memory modules using the shuffleexchange network,"IEEE Trans. Comput., vol. C25, pp. 496503, May 1976.
[11] D. H. Lawrie and D. A. Padua, "Analysis of message switching with shuffleexchange in multiprocessors," inProc. Workshop in Interconnection Networks for Parallel and Distributed Processing, Apr. 1980, pp. 116123.
[12] D. H. Lawrie, "Memoryprocessor connection networks," Ph.D. dissertation, Univ. of Illinois at UrbanaChampaign, UMI #7315783, Feb. 1973.
[13] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C24, pp. 11451155, Dec. 1975.
[14] D. C. Opferman and N. T. TsaoWu, "On a class of rearrangeable switching networks, Part I: Control algorithm,"Bell Syst. Tech. J., vol. 50, no. 5, pp. 15791600, MayJune 1971.
[15] K. Padmanabhan and D. H. Lawrie, "A class of redundant path multistage interconnection networks,"IEEE Trans. Comput., vol. C32, pp. 10991108, Dec. 1983.
[16] J. H. Patel, "Performance of processormemory interconnections for multiprocessors,"IEEE Trans. Comput., vol. C30, pp. 771780, Oct. 1981.
[17] M. C. Pease, "An adaptation of the fast Fourier transform for parallel processing,"J. ACM, vol. 15, pp. 252264, 1968.
[18] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C20, pp. 153161, Feb. 1971.
[19] I. M. Vinogradov,Elements of Number Theory. New York: Dover, 1954, ch. III.
[20] PC. Yew, D. A. Padua, and D. H. Lawrie, "Stochastic properties of a multiplelayer singlestage shuffleexchange network in a message switching environment,"J. Digital Syst., vol. VI, no. 4, pp. 387410, 1982.