The Community for Technology Leaders
Green Image
<p>A family of six-regular graphs, called hexagonal meshes or H-meshes, is considered as a multiprocessor interconnection network. Processing nodes on the periphery of an H-mesh are first wrapped around to achieve regularity and homogeneity. The diameter of a wrapped H-mesh is shown to be of O(p/sup 1/2/), where p is the number of nodes in the H-mesh. An elegant, distributed routing scheme is developed for wrapped H-meshes so that each node in an H-mesh can compute shortest paths from itself to any other node with a straightforward algorithm of O(1) using the addresses of the source-destination pair only, i.e. independent of the network's size. This is in sharp contrast with those previously known algorithms that rely on using routing tables. Furthermore, the authors also develop an efficient point-to-point broadcasting algorithm for the H-meshes which is proved to be optimal in the number of required communication steps. The wrapped H-meshes are compared against some other existing multiprocessor interconnection networks, such as hypercubes, trees, and square meshes. The comparison reinforces the attractiveness of the H-mesh architecture.</p>
addressing; routing; broadcasting; hexagonal mesh multiprocessors; six-regular graphs; H-meshes; multiprocessor interconnection network; hypercubes; trees; square meshes; graph theory; multiprocessor interconnection networks.

M. Chen, K. Shin and D. Kandlur, "Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors," in IEEE Transactions on Computers, vol. 39, no. , pp. 10-18, 1990.
98 ms
(Ver 3.3 (11022016))