*IEEE Transactions on Computers*, vol.44, no. 12, pp. 1462-1468, December 1995, doi:10.1109/12.477252

p×

Subscribe

Issue No.12 - December (1995 vol.44)

pp: 1462-1468

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.477252

ABSTRACT

<p><it>Abstract</it>—Dense, symmetric graphs are useful interconnection models for multicomputer systems. Borel Cayley graphs, the densest degree-4 graphs for a range of diameters [<ref rid="BIBC14621" type="bib">1</ref>], are attractive candidates. However, the group-theoretic representation of these graphs makes the development of efficient routing algorithms difficult. In earlier reports, we showed that all degree-4 Borel Cayley graphs have generalized chordal ring (GCR) and chordal ring (CR) representations [<ref rid="BIBC14622" type="bib">2</ref>], [<ref rid="BIBC14623" type="bib">3</ref>]. In this paper, we present the class-congruence property and use this property to develop the two-phase routing algorithm for Borel Cayley graphs in a special GCR representation. The algorithm requires a small space complexity of O(<it>p</it>+<it>k</it>) for <it>n</it>=<it>p</it>×<it>k</it> nodes. Although suboptimal, the algorithm finds paths with length bounded by 2<it>D</it>, where <it>D</it> is the diameter. Furthermore, our computer implementation of the algorithm on networks with 1,081 and 15,657 nodes shows that the average path length is on the order of the diameter. The performance of the algorithm is compared with that of existing optimal and suboptimal algorithms.</p>

INDEX TERMS

Generalized chordal ring, interconnection network, parallel computer.

CITATION

Bruce W. Arden, K. Wendy Tang, "Class-Congruence Property and Two-Phase Routing of Borel Cayley Graphs", *IEEE Transactions on Computers*, vol.44, no. 12, pp. 1462-1468, December 1995, doi:10.1109/12.477252