Product-shuffle networks: toward reconciling shuffles and butterflies
Discrete Applied Mathematics - Special double volume: interconnection networks
Optimal emulations by butterfly-like networks
Journal of the ACM (JACM)
Mesh-Connected Trees: A Bridge Between Grids and Meshes of Trees
IEEE Transactions on Parallel and Distributed Systems
The Cross Product of Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Products of Networks with Logarithmic Diameter and Fixed Degree
IEEE Transactions on Parallel and Distributed Systems
Design and analysis of product networks
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Reliable broadcasting in product networks in the presence of faulty nodes
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Vertex vulnerability parameters of Kronecker products of complete graphs
Information Processing Letters
Super connectivity of Kronecker products of graphs
Information Processing Letters
Note: Wiener and vertex PI indices of Kronecker products of graphs
Discrete Applied Mathematics
On edge connectivity of direct products of graphs
Information Processing Letters
On the super connectivity of Kronecker products of graphs
Information Processing Letters
Hi-index | 0.98 |
This paper describes a modeling technique, finite state automata (FA) model, for the cross product of interconnection networks. The primary purpose of the proposed modeling technique is to provide a mechanism for developing efficient routing and novel embedding algorithms, which we refer to as node-independent algorithms, for product networks. In contrast to the current embedding algorithms which are node dependent (their output is a set of adjacent node labels which forms the desired topology), the embedding algorithms developed in this paper are rule-based. That is, they generate a set of rules (input sequences to the FA model of the network) which can be used by any node for mapping a desired topology into the network. Furthermore, a new interconnection topology, called Ring Connected Cycles (RCC), is introduced. The main objective of introducing RCC networks is to illustrate the use of the FA model to develop node-independent embedding as well as routing algorithms. In addition, to demonstrate the generality of the proposed technique, FA models of several popular interconnection networks (such as n-cubes and n-star graphs) are presented. The RCC networks are proposed in this paper as a possible communication network for parallel multicomputers or as an alternative to the ring topology for local area networks. An RCC network can execute grid, mesh and ring algorithms as efficiently as the grid, mesh, and ring networks. It is shown in Section 6 that this significant amount of computational versatility offered by RCC networks comes at no additional VLSI area cost over the same size ring, grid, or mesh networks.