Browse > Article

Design of a Partitionable Single-Stage Shuffle-Exchange Network  

Lee, Jae-Dong (단국대학교 컴퓨터과학전공)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.30, no.3_4, 2003 , pp. 130-137 More about this Journal
Abstract
This paper presents the problem of partitioning the Single-Stage Shuffle-Exchange Network(SSEN). An algorithm, named SSEN_to_PSEN, is devised to transform an SSEN into a Partitionable Shuffle-Exchange Network (PSEN). The proposed algorithm presents that the SSEN can be partitioned into independent sub-networks without additional links for N $\leq$ 8. Additional links are needed in order to partition an SSEN, but only when N $\geq$ 16. The running time of the algorithm SSEN_to_PSEN is $\theta$(NlogN). By comparing with a hypercube network, the PSEN is less expensive than a hypercube network even when some additional links are added. By partitioning, a large PSEN in a massively parallel machine can compute various problems for multiple users simultaneously, thereby the processing efficiency of the machine is improved.
Keywords
Shuffle-exchange network; Partitionability; Single-Stage network; Interconnection network; Parallel computer;
Citations & Related Records
연도 인용수 순위
  • Reference
1 T. Lang and H. Stone, 'A Shuffle-Exchange Network with Simplified Control,' IEEE Transactions on Computers, Vol. C-25, NO.1, Jan. 1976
2 H.J. Siegel, 'Partitionable SIMD computer system interconnection network universality,' in Proc. 16th annual Allerton Conference on Communication, Control and Computers, pp.586-595, Oct. 1978
3 H.J. Siegel, 'The Theory Underlying the Partitioning of Permutation Networks,' IEEE Transactions on Computers, Vol. C-29, No.9, September 1980   DOI   ScienceOn
4 H-I. Choi, `Fault tolerant Bitonic Sorting Networks and Static Shuffle-Exchange Networks,` Ph.D Dissertation, Kent State University, 1997
5 V. Kumar, A. Grama, A Gupta, and G. Karypis, 'Introduction to Parallel Computing : design and analysis of parallel algorithms', The Benjamin / Cummings Publishing Company Inc., 1994
6 K.E. Batcher, 'Low-cost Flexible Simulation with the Static Perfect Shuffle Network,' Fourth Symposium on the Frontiers of Massively Parallel Computation (Frontiers '92), pp.434-441, IEEE Computer Society Press, Oct. 1992   DOI
7 K.E. Batcher, 'Decomposition of Perfect Shuffle Networks,' Proceedings of the 1991 International Conference on Parallel Processing, CRC Press, Boca Raton FL, Vol.I, pp,255-262, 1991
8 H.S. Stone, 'High- Performance Computer Architecture', Second Edition, Addison-Wesley, Reading MA, 1990
9 J-D. Lee and K Batcher, 'Minimizing Communication in the Bitonic Sort,' IEEE Transactions on Parallel and Distributed Systems, Vol. 11, No.5, May 2000   DOI   ScienceOn
10 H.J. Siegel, 'Interconnection networks for Larae-Saue Parallel Processing : Theory and Case Studies', Second Edition, McGraw-Hill, 1990
11 H.S. Stone, 'Parallel processing with the perfect shuffle,' IEEE Transactions on Computers, Vol C-20, pp. 153-161, Feb.1971   DOI   ScienceOn
12 Sara Baase and Allen Van Gelder, 'Computer Algorithms:3rd Edition', Addison Wesley, 2000
13 D.E. Culler, J.P. Singh and A. Gupta, 'Parallel Computer Architecture: A Hardware/software Approach', M.K. Publishers, CA, 1998
14 P. Chen, D.H. Lawrie, and D.A. Padua, 'Interconnection Networks using shuffles,' IEEE Computer, Vol. 14, pp.55-64, Dec. 1981   DOI   ScienceOn