
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M.S. Chen, K.G. Shin, D.D. Kandlur, "Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors," IEEE Transactions on Computers, vol. 39, no. 1, pp. 1018, January, 1990.  
BibTex  x  
@article{ 10.1109/12.46277, author = {M.S. Chen and K.G. Shin and D.D. Kandlur}, title = {Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {1}, issn = {00189340}, year = {1990}, pages = {1018}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.46277}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors IS  1 SN  00189340 SP10 EP18 EPD  1018 A1  M.S. Chen, A1  K.G. Shin, A1  D.D. Kandlur, PY  1990 KW  addressing; routing; broadcasting; hexagonal mesh multiprocessors; sixregular graphs; Hmeshes; multiprocessor interconnection network; hypercubes; trees; square meshes; graph theory; multiprocessor interconnection networks. VL  39 JA  IEEE Transactions on Computers ER   
A family of sixregular graphs, called hexagonal meshes or Hmeshes, is considered as a multiprocessor interconnection network. Processing nodes on the periphery of an Hmesh are first wrapped around to achieve regularity and homogeneity. The diameter of a wrapped Hmesh is shown to be of O(p/sup 1/2/), where p is the number of nodes in the Hmesh. An elegant, distributed routing scheme is developed for wrapped Hmeshes so that each node in an Hmesh can compute shortest paths from itself to any other node with a straightforward algorithm of O(1) using the addresses of the sourcedestination 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 pointtopoint broadcasting algorithm for the Hmeshes which is proved to be optimal in the number of required communication steps. The wrapped Hmeshes are compared against some other existing multiprocessor interconnection networks, such as hypercubes, trees, and square meshes. The comparison reinforces the attractiveness of the Hmesh architecture.
[1] K. Hwang and J. Ghosh, "Hypernet: A communicationefficient architecture for constructing massively parallel computers,"IEEE Trans. Comput., vol. C36, pp. 14501466, Dec. 1987.
[2] W. D. Hillis,The Connection Machine. Cambridge, MA: MIT Press, 1985.
[3] T. Y. Feng, "A survey of interconnection networks,"IEEE Comput. Mag., pp. 1227, Dec. 1981.
[4] C. Wu and T. Y. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C29, no. 8, pp. 694702, Aug. 1980.
[5] R. S. Wilkov, "Analysis and design of reliable computer networks,"IEEE Trans. Comput., vol. C20, no. 3, pp. 670678, June 1972.
[6] G. A. Anderson and E. D. Jensen, "Computer interconnection networks: Taxonomy, characteristics and examples,"ACM Comput. Surveys, vol. 7, pp. 197213, Dec. 1975.
[7] W. A. Wulf, E. Cohe, W. Corwin, A. Jones, R. Levin, C. Pierson, and F. Pollack, "HYDRA: The kernel of a multiprocessor operating system,"Commun. ACM, vol. 17, pp. 337345, June 1974.
[8] D. Mills, "An overview of the distributed computer network," inProc. Nat. Comput. Conf., vol. 45, 1976, pp. 523531.
[9] K. S. Stevens, S. V. Robison, and A. L. Davis, "The Post OfficeCommunication support for distributed ensemble architectures," inProc. Six Int. Conf. Distrib. Comput. Syst., 1986, pp. 160166.
[10] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 2233, Jan. 1985.
[11] T. Y. Feng, "Data manipulation functions in parallel processors and their implementations,"IEEE Trans. Comput., vol. C23, no. 3, pp. 309318, Mar. 1974.
[12] B. W. Arden and H. Lee, "Analysis of chordal ring network,"IEEE Trans. Comput., vol. C30, no. 4, pp. 291294, Apr. 1981.
[13] R. A. Finkel and M. H. Solomon, "Processor interconnection strategies,"IEEE Trans. Comput., vol. C29, no. 5, pp. 360370, May 1980.
[14] L. D. Wittie, "Communication structures for large networks of microcomputers,"IEEE Trans. Comput., vol. C30, no. 4, pp. 264273, Apr. 1981.
[15] A. J. Martin, "The Torus: An exercise in constructing a processing surface," inProc. 2nd Caltech Conf. VLSI, 1981, pp. 527537.
[16] M. Watkins, "Connectivity of transitive graphs,"J. Combinatorial Theory, vol. 8, pp. 2329, 1970.
[17] J. Turner, "Pointsymmetric graphs with a prime number of points,"J. Combinatorial Theory, vol. 3, pp. 136145, 1967.
[18] S. L. Hakimi, "An algorithm for construction of the least vulnerable communication network or the graph with the maximum connectivity,"IEEE Trans. Circuit Theory., vol. CT16, pp. 229230, May 1969.
[19] F. T. Boesch and R. E. Thomas, "On graphs of invulnerable communication nets,"IEEE Trans. Circuit Theory, vol. CT17, no. 5, pp. 183191, May 1970.
[20] R. Halin, "A theorem on Nconnected graphs,"J. Combinatorial Theory, vol. 7, pp. 150154, 1969.
[21] C. T. Ho and S. L. Johnsson, "Distributed routing algorithms for broadcasting and personalized communication in hypercubes," inProc. Int. Conf. Parallel Processing, Aug. 1986, pp. 640648.
[22] F. Harary,Graph Theory. Reading, MA: AddisonWesley, 1969.
[23] E. Horowitz and A. Zorat, "The binary tree as an interconnection network: Applications to multiprocessor systems and VLSI,"IEEE Trans. Comput., vol. C30, no. 4, pp. 247253, Apr. 1981.
[24] J. R. Goodman and C. H. Sequin, "Hypertree: A multiprocessor interconnection topology,"IEEE Trans. Comput., vol. C30, no. 12, pp. 923933, Dec. 1981.