Browse > Article
http://dx.doi.org/10.6109/jkiice.2017.21.7.1327

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)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.21, no.7, 2017 , pp. 1327-1334 More about this Journal
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.
Keywords
Interconnection network; Bubblesort; Network cost; Diameter;
Citations & Related Records
연도 인용수 순위
  • Reference
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.   DOI
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.   DOI
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.   DOI
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.   DOI
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.