A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Group action graphs and parallel architectures
SIAM Journal on Computing
The diameter and average distance of supertoroidal networks
Journal of Parallel and Distributed Computing
Routing in a class of Cayley graphs of semidirect products of finite groups
Journal of Parallel and Distributed Computing
Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
Topology Optimization of Interconnection Networks
IEEE Computer Architecture Letters
A Group Construction Method with Applications to Deriving Pruned Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Analysis of interconnection networks based on simple Cayley coset graphs
SPDP '93 Proceedings of the 1993 5th IEEE Symposium on Parallel and Distributed Processing
| Hi-index | 0.00 |
Metacyclic graphs, which include supertoroids as a subclass, have been shown to possess interesting properties and potential applications in implementing moderate-to large-size parallel processors with fairly small node degrees. Wu, Lakshmivarahan, and Dhall (J. Parallel Distrib. Comput. 60 (2000), pp. 539-565) have described a deterministic, distributed routing scheme for certain subclasses of metacyclic graphs. However, they offer no proof that the scheme is a shortest-path routing algorithm and do not indicate whether or how their scheme may be extended to the entire class of metacyclic graphs. In this paper, we provide a near-shortest-path, deterministic routing algorithm that is applicable to any metacyclic graph and derive a bound for the diameter of such graphs.