Journal of KIISE:Computer Systems and Theory (한국정보과학회논문지:시스템및이론)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Design of a Partitionable Single-Stage Shuffle-Exchange Network

분할 가능한 단단계(Single-Stage) Shuffle-Exchange 네트워크의 설계

  • Published : 2003.04.01
Download PDF
⟨ Previous Next ⟩

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.

본 논문에서는 단단계(Single-Stage) Shuffle-Exchange 네트워크의 분할성에 대하여 연구하였다. SSEN_to_PSEN 알고리즘은 단단계 Shuffle-Exchange 네트워크를 분할 가능한 Shuffle-Exchange 네트워크로 변환하는 방법을 제안한다. 제안된 알고리즘은 네트워크의 크기가 N $\leq$ 8일 경우에는 추가적인 링크없이 네트워크가 분할성을 갖는 것을 보이며, 네트워크의 크기가 N $\geq$ 16일 경우에 단단계 Shuffle-Exchange 네트워크를 분할하기 위해서는 추가적인 링크가 필요하다. SSEN_to_PSEN 알고리즘의 시간 복잡도는 $\theta$(NlogN)이며, 하이퍼큐브 네트워크와 비교하여 분할 가능한 Shuffle-Exchange 네트워크는 적은 링크 수를 사용한다. 분할이 가능해짐에 따라서 대용량의 병렬컴퓨터에서 분할 가능한 Shuffle-Exchange 네트워크는 여러 사용자들을 위한 다양한 문제의 처리가 동시에 가능하기 때문에 컴퓨터의 처리 효율이 향상됨을 알 수 있다.

Keywords

References

  1. Sara Baase and Allen Van Gelder, 'Computer Algorithms:3rd Edition', Addison Wesley, 2000
  2. D.E. Culler, J.P. Singh and A. Gupta, 'Parallel Computer Architecture: A Hardware/software Approach', M.K. Publishers, CA, 1998
  3. 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
  4. P. Chen, D.H. Lawrie, and D.A. Padua, 'Interconnection Networks using shuffles,' IEEE Computer, Vol. 14, pp.55-64, Dec. 1981 https://doi.org/10.1109/C-M.1981.220297
  5. 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
  6. T. Lang and H. Stone, 'A Shuffle-Exchange Network with Simplified Control,' IEEE Transactions on Computers, Vol. C-25, NO.1, Jan. 1976
  7. 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 https://doi.org/10.1109/71.852399
  8. H.J. Siegel, 'The Theory Underlying the Partitioning of Permutation Networks,' IEEE Transactions on Computers, Vol. C-29, No.9, September 1980 https://doi.org/10.1109/TC.1980.1675678
  9. H-I. Choi, `Fault tolerant Bitonic Sorting Networks and Static Shuffle-Exchange Networks,` Ph.D Dissertation, Kent State University, 1997
  10. H.J. Siegel, 'Interconnection networks for Larae-Saue Parallel Processing : Theory and Case Studies', Second Edition, McGraw-Hill, 1990
  11. 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 https://doi.org/10.1109/FMPC.1992.234883
  12. 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
  13. H.S. Stone, 'High- Performance Computer Architecture', Second Edition, Addison-Wesley, Reading MA, 1990
  14. H.S. Stone, 'Parallel processing with the perfect shuffle,' IEEE Transactions on Computers, Vol C-20, pp. 153-161, Feb.1971 https://doi.org/10.1109/T-C.1971.223205