Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

Design and feature analysis of a new interconnection network : Half Bubblesort Graph

새로운 상호연결망 하프 버블정렬 그래프 설계 및 성질 분석

  • Seo, Jung-Hyun (Department of Computer Engineering, National University of Sunchon) ;
  • Sim, Hyun (Center for Teaching and Learning, National University of Sunchon) ;
  • Lee, Hyeong Ok (Department of Computer Education, National University of Sunchon)
  • Received : 2017.05.29
  • Accepted : 2017.06.10
  • Published : 2017.07.31
Download PDF
⟨ Previous Next ⟩

Abstract

The Bubble sort graph is node symmetric, and can be used in the data sorting algorithm. In this research we propose and analyze that Half Bubble sort graph that improved the network cost of Bubble sort graph. The Half Bubble sort graph's number of node is n!, and its degree is ${\lfloor}n/2{\rfloor}+1$. The Half Bubble sort graph's degree is $${\sim_=}0.5$$ times of the Bubble sort, and diameter is $${\sim_=}0.9$$ times of the Bubble sort. The network cost of the Bubble sort graph is $${\sim_=}0.5n^3$$, and the network cost of the half Bubble sort graph is $${\sim_=}0.2n^3$$. We have proved that half bubble sort graph is a sub graph of the bubble sort graph. In addition, we proposed a routing algorithm and analyzed the diameter. Finally, network cost is compared with the bubble sort graph.

버블정렬 그래프는 노드 대칭이며 데이터 정렬 알고리즘에 활용 할 수 있다. 본 연구에서는 버블정렬 그래프의 망 비용을 개선한 하프 버블정렬 그래프를 제안하고 분석한다. 하프 버블정렬 그래프 $HB_n$의 노드수는 n!이고 분지수는 ${\lfloor}n/2{\rfloor}+1$이다. 하프 버블정렬 그래프의 분지수는 버블정렬 그래프의 분지수의 $${\sim_=}0.5$$배 이고, 지름은 $${\sim_=}0.9$$배 이다. 버블정렬 그래프의 망 비용은 $${\sim_=}0.5n^3$$이고, 하프 버블정렬 그래프의 망 비용은 $${\sim_=}0.2n^3$$이다. 하프 버블정렬 그래프는 버블정렬 그래프의 서브 그래프임을 증명하였다. 추가로 라우팅 알고리즘을 제안하였고 지름을 분석하였다. 마지막으로 버블정렬 그래프와 망 비용을 비교 하였다.

Keywords

References

  1. S. Klaus, The fourth industrial revolution. Penguin UK, 2017.
  2. J. H. Seo, "Three-dimensional Petersen-torus network: a fixed-degree network for massively parallel computers," The Journal of Supercomputing, vol. 64, no 3, pp. 987- 1007, Jun. 2013. https://doi.org/10.1007/s11227-011-0716-z
  3. P. Matthew, et al, "There and Back Again: Optimizing the Interconnect in Networks of Memory Cubes," Proceedings of the 44th Annual International Symposium on Computer Architecture, pp. 678-690, 2017.
  4. N. Y. Phing, et al, "Topology Design of Extended Torus and Ring for Low Latency Network-on-Chip Architecture," Telecommunication Computing Electronics and Control, vol. 15, no. 2, pp. 869-876, Jun. 2017.
  5. C. H. Yeh and E. A. Varvarigos, "Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 10, pp. 987-1003, Oct. 1998. https://doi.org/10.1109/71.730528
  6. Q. Dong, J. Zhou, et al, "Embedding a mesh of trees in the crossed cube." Information Processing Letters, vol. 112, no. 14-15, pp. 599-603, Aug. 2012. https://doi.org/10.1016/j.ipl.2012.04.013
  7. H. Hossein, and A. Patooghy. (2017, Apr.). Fault-tolerant routing methodology for hypercube and cube-connected cycles interconnection networks. The Journal of Supercomputing [Online]. pp. 1-20. Available: https://link.springer.com/article/10.1007/s11227-017-2033-7.
  8. S. B. Akers and B. Krishnamurthy, "A group-theoretic model for symmetric interconnection networks," IEEE Transactions on Computers, vol. 38, no. 4, pp. 555-566, Apr. 1989. https://doi.org/10.1109/12.21148
  9. M. Heydari and I. Sudborough. "On sorting by prefix reversals and the diameter of pancake networks," In Proceedings of the First Heinz Nixdorf Symposium on Parallel Architectures and Their Ecient Use, London, UK, pp. 218-227, May 1993.
  10. Z. T. Chou, et al, "Bubblesort star graphs: a new interconnection network," in Proceedings of the Parallel and Distributed Systems, Tokyo, Japan, pp. 41-48, Jun. 1996.