Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014 (2014), Article ID 935737, 10 pages
http://dx.doi.org/10.1155/2014/935737
Research Article

Broadcasting Algorithms of Three-Dimensional Petersen-Torus Network

1Department of Computer Science, University of Rochester, Rochester, NY 14627, USA
2Department Of Computer Education, Sunchon National University, Sunchon, Chonnam 540-742, Republic of Korea
3Department Of Computer Science Education, Catholic University of Daegu, Gyeongsan, Gyeongbuk 712-702, Republic of Korea
4Department of Information and Communication Engineering, Yeungnam University, Gyeongsan, Gyeongbuk 712-749, Republic of Korea

Received 19 November 2013; Accepted 4 March 2014; Published 10 April 2014

Academic Editor: Guangchen Wang

Copyright © 2014 Jong-Seok Kim et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. W. Zhou, J. Fan, X. Jia, and S. Zhang, “The spined cube: a new hypercube variant with smaller diameter,” Information Processing Letters, vol. 111, no. 12, pp. 561–567, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. S. Lennart Johnsson, “Communication efficient basic linear algebra computations on hypercube architectures,” Journal of Parallel and Distributed Computing, vol. 4, no. 2, pp. 133–172, 1987. View at Google Scholar · View at Scopus
  3. V. E. Mendia and D. Sarkar, “Optimal broadcasting on the star graph,” IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 4, pp. 389–396, 1992. View at Publisher · View at Google Scholar · View at MathSciNet
  4. L. Bai, H. Maeda, H. Ebara, and H. Nakano, “A broadcasting algorithm with time and message optimum on arrangement graphs,” Journal of Graph Algorithms and Applications, vol. 2, no. 2, pp. 1–17, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. J. Carle, J. F. Myoupo, and D. Seme, “All-to-all broadcasting algorithms on honeycomb networks and applications,” Parallel Processing Letters, vol. 9, no. 4, pp. 539–550, 1999. View at Publisher · View at Google Scholar · View at Scopus
  6. M. M. De Azevedo, N. Bagherzadeh, and S. Latifi, “Broadcasting algorithms for the star-connected cycles interconnection network,” Journal of Parallel and Distributed Computing, vol. 25, no. 2, pp. 209–222, 1995. View at Publisher · View at Google Scholar · View at Scopus
  7. I. M. Mkwawa and D. D. Kouvatsos, “An optimal neighborhood broadcasting scheme for star interconnection networks,” Journal of Interconnection Networks, vol. 4, no. 1, pp. 103–112, 2003. View at Publisher · View at Google Scholar
  8. J.-H. Seo and H.-O. Lee, “One-to-all broadcasting in petersen-torus networks for SLA and MLA models,” ETRI Journal, vol. 31, no. 3, pp. 327–329, 2009. View at Publisher · View at Google Scholar · View at Scopus
  9. J.-H. Seo, “Three-dimensional Petersen-torus network: a fixed-degree network for massively parallel computers,” Journal of Supercomputing, vol. 64, no. 3, pp. 987–1007, 2013. View at Publisher · View at Google Scholar · View at Scopus
  10. D. A. Holton and J. Sheehan, The Petersen Graph, vol. 7 of Australian Mathematical Society Lecture Series, Cambridge University Press, Cambridge, Mass, USA, 1993. View at Publisher · View at Google Scholar · View at MathSciNet