This paper presents a convenient addressing scheme on 2-D hexagonal meshes. It helps to derive simple and optimal routing and one-to-all broadcasting algorithms. We also show the existence of a Hamiltionian cycle that yields a ring embedding. We define 3-D hexagonal graph as a generalization of the triangular plane tessellation, and consider it as a multiprocessor interconnection net-work. Some of its topological properties are studied. These properties are better than the well-known multi-dimensional square mesh. A simple and optimal routing algorithm is also presented.
展开▼
