By Topic

Addressing, routing, and broadcasting in hexagonal mesh multiprocessors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ming-Syan Chen ; IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA ; Shin, K.G. ; Kandlur, D.D.

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(p1/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

Published in:

Computers, IEEE Transactions on  (Volume:39 ,  Issue: 1 )