Browse > Article
http://dx.doi.org/10.9717/kmms.2014.17.6.716

A Half Pancake network that improve the network cost for Pancake graph  

Kim, JuBong (Sunchon High School)
Seo, Jung-Hyun (Dept. of Computer Engineering, Sunchon National University)
Lee, HyeongOk (Dept. of Computer Education, Sunchon National University)
Publication Information
Journal of Korea Multimedia Society / v.17, no.6, 2014 , pp. 716-724 More about this Journal
Abstract
The pancake graph is node symmetric and is utilized on the data sorting algorithm. We propose a new half pancake graph that improve pancake graph's network cost. The half pancake degree is approximately half of pancakes degree and diameter is 3n+4. The pancake graph's network cost is $O(1.64n^2)$ and half pancake's is $O(1.5n^2)$. Additionally half pancake graph is sub graph of pancake graph. As this result, The several algorithms developed in pancake graph has the advantage of leverage on the pancake by adding constant cost.
Keywords
Interconnection network; Pancake Graph; Star Graph; Routing Algorithm;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 M.H. Heydari and I.H. Sudborough, "On Sorting by Prefix Reversals and the Diameter of Pancake Networks," Proceedings of the First Heinz Nixdorf Symposium on Parallel Architectures and Their Ecient Use, pp. 218-227, 1993.
2 M.H. Heydari and I.H. Sudborough, "On the Diameter of the Pancake Network," Journal of Algorithms, Vol. 25, No. 1, pp. 67-94, 1997.   DOI   ScienceOn
3 K. Hwang and F.A. Briggs, Computer Architecture and Parallel Processing, 4th Printing, McGraw-Hill International Editions, New York, 1988.
4 J. Kim, Design and Analysis for Half Pancake, Master's Thesis of University of Sunchon, 2014.
5 E. Konstantinova, "On Some Structural Properties of Star and Pancake Graphs," LNCS, Vol. 7777, No. 2013, pp. 472-487, 2013.
6 S.B. Akers and B. Krishnamurthy, "A group-Theoretic Model for Symmertric Interconnection Network," IEEE Transations on Computer, Vol. 38, No. 4, pp. 555-565, 1989.   DOI   ScienceOn
7 K. Keiichi, "Routing Problems in Incomplete Pancake Graphs," Proceedings of Seventh IEEE ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel Distributed Computing, pp. 151-156, 2006.
8 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, 1998.   DOI   ScienceOn
9 Q. Dong, J. Zhou, Y. Fu, X. Yang, "Embedding a Mesh of Trees in the Crossed Cube," Information Processing Letters, Vol. 112, No. 14-15, pp. 599-603, 2012.   DOI   ScienceOn
10 Y. Saad and M.H. Schultz, "Topological Properties of Hypercubes," IEEE Transactions on Computer, Vol. 37, No. 7, pp. 867-872, 1988.   DOI   ScienceOn
11 J.S. Kim, E. Cheng, and H.O. Lee, "Embedding Hypercubes, Rings, and Odd Graphs into Hyper-Stars," International Journal of Computer Mathematics, Vol. 86, No. 5, pp. 771-778, 2013.
12 H. Dweighter, Amer, Math, Monthly, Vol. 82, No. 1, pp. 1010, 1975.   DOI   ScienceOn
13 A. Varma and C.S. Raghavendra, "Interconnection Networks for Multiprocessors and Multicomputers Theory and Practice," IEEE Computer Society Press, pp. 8-18, 1994.
14 T. Feng, "A Survey of Interconnection Networks," IEEE Transactions on Computers, Vol. 14, No. 12, pp. 12-27, 1981.
15 J.H. Chang, "Cycle Extendability of Torus Sub-Graphs in the Enhanced Pyramid Network," Journal of Korea Multimedia society, Vol. 13, No. 8, pp. 1183-1193, 2010.   과학기술학회마을