This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
3D Hexagonal Network: Modeling, Topological Properties, Addressing Scheme, and Optimal Routing Algorithm
September 2005 (vol. 16 no. 9)
pp. 875-884

Abstract—The 2D hexagonal mesh, based on triangle plane tessellation, is considered as a multiprocessor interconnection network. The 3D hexagonal mesh is presented as a natural extension of the hexagonal mesh. Although the topological properties of the 2D hexagonal mesh are well known, existing addressing schemes are not suitable to be extended to 3D hexagonal mesh. Then, we present, in this paper, a new addressing scheme and an optimal routing algorithm for 2D hexagonal network based on the distance formula and using shortest paths. We propose also a 3D hexagonal network that can be built with 2D hexagonal meshes as a natural generalization. We also present some topological properties, an efficient addressing scheme, and an optimal routing algorithm based on our 2D routing algorithm.

[1] S.G. Akl, Parallel Computation: Models and Methods. Prentice Hall, 1997.
[2] H. Aykanat and T. Ozguner, “A Fault Tolerant Hexagonal Systolic Array,” Information Processing Letters, vol. 42, pp. 187-196, 1992.
[3] U. Black, Mobile and Wireless Networks. Upper Saddle River, N.J.: Prentice-Hall PTR, 1996.
[4] J. Carle, “Etude des propriétés des réseaux d'interconnexion de type nids d'abeilles,” PhD thesis, Université de Picardie Jules Verne, Faculté de Mathématiques et d'Informatique, Amiens, France, 2000.
[5] J. Carle and J.F. Myoupo, “Topological Properties and Optimal Routing Algorithms for Three Dimensional Hexagonal Networks,” Proc. Int'l Conf. High-Performance Computing in the Asia-Pacific Region (HPC-Asia 2000), pp. 116-121, 2000.
[6] J. Carle, J.F. Myoupo, and D. Semé, “All-to-All Broadcasting Algorithms on Honeycomb Networks and Applications,” Parallel Processing Letters, vol. 9, no. 4, pp. 539-550, 1999.
[7] M.S. Chen, K.G. Shin, and D.D. Kandlur, “Addressing, Routing and Broadcasting in Hexagonal Mesh Multiprocessors,” IEEE Trans. Computers, vol. 39, no. 1, pp. 10-18, Jan. 1990.
[8] J.W. Dolter, P. Ramanathan, and K.G. Shin, “Performance Analysis of Virtual Cut-through Switching in HARTS: A Hexagonal Mesh Multicomputer,” IEEE Trans. Computers, vol. 40, no. 6, pp. 669-680, June 1991.
[9] F. Garcia, I. Stojmenovic, and J. Zhang, “Addressing and Routing in Hexagonal Networks with Applications for Location Update and Connection Rerouting in Cellular Networks,” technical report, manuscript, 2000.
[10] V.K. Garg and J.E. Wilkes, Wireless and Personal Communication Systems. Upper Saddle River, N.J.: Prentice-Hall PTR, 1996.
[11] D. Gordon, I. Koren, and G.M. Silberman, “Embedding Tree Structures in VLSI Hexagonal Arrays,” IEEE Trans. Computers, vol. 33, pp. 104-107, 1984.
[12] D. Milutinovic, V. Milutinovic, and B. Soucek, “The Honeycomb Architecture,” Computer, vol. 20, no. 4, pp. 81-83, Apr. 1987.
[13] V. Milutinovic, “Mapping of Neural Network on the Honeycomb Architecture,” Proc. IEEE, vol. 77, no. 12, pp. 1875-1878, 1989.
[14] J.-F. Myoupo, H. NDamas, and D. Semé, “Hexagonal Mesh: A New Addressing Scheme and an Optimal Routing Algorithm,” Proc. Int'l Symp. Parallel and Distributed Computing and Networks, PDCN '02, 2002.
[15] F. Garcia Nocetti, J. Solano González, I. Stojmenovic, and M. Stojmenovic, “Addressing and Routing in Higher Dimensional Hexagonal Networks,” Proc. Int'l Conf. Parallel and Distributed Processing Techniques and Applications, PDPTA-01, pp. 1726-1732, 2001.
[16] F. Garcia Nocetti, J. Solano González, I. Stojmenovic, and M. Stojmenovic, “Higher Dimensional Hexagonal Networks,” J. Parallel Distributed Computing, vol. 63, pp. 1164-1172, 2003.
[17] B. Parhami, Introduction to Parallel Processing: Algorithms and Architectures. Plenium, 1998.
[18] Y.R. Potlapalli, “Trend in Interconnection Network Topologies: Hierarchical Networks,” Proc. Int'l Conf. Parallel Processing Workshop, 1995.
[19] M.J. Quinn, Parallel Computing, Theory and Practice. McGraw-Hill, 1994.
[20] B. Robic and J. Silc, “High-Performance Computing on a Honeycomb Architecture,” Proc. Second Int'l ACPC, Parallel Computation Conf., 1993.
[21] K.G. Shin, “HARTS: A Distributed Real-Time Architecture,” Computer, vol. 24, no. 5, pp. 25-35, May 1991.
[22] I. Stojmenovic, Parallel and Distributed Computing Handbook, chapter direct interconnection networks, pp. 537-567, A.Y. Zomaya, ed., 1996.
[23] I. Stojmenovic, “Honeycomb Networks: Topological Properties and Communication Algorithms,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 10, pp. 1036-1042, Oct. 1997.
[24] H.Y. Youn and J.Y. Lee, “An Efficient Dictionary Machine Using Hexagonal Processor Array,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 3, pp. 266-273, Mar. 1996.

Index Terms:
Parallel architectures, interconnection networks, hexagonal mesh, routing, communication algorithms.
Citation:
Catherine Decayeux, David Sem?, "3D Hexagonal Network: Modeling, Topological Properties, Addressing Scheme, and Optimal Routing Algorithm," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 9, pp. 875-884, Sept. 2005, doi:10.1109/TPDS.2005.100
Usage of this product signifies your acceptance of the Terms of Use.