On permutations passable by the Gamma network
Journal of Parallel and Distributed Computing
Design and Analysis of Dynamic Redundancy Networks
IEEE Transactions on Computers
Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.)
Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.)
Performance and fault tolerance improvements in the Inverse Augmented Data Manipulator network
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
The Gamma network: A multiprocessor interconnection network with redundant paths
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Study of multistage SIMD interconnection networks
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
CGIN: A Fault Tolerant Modified Gamma Interconnection Network
IEEE Transactions on Parallel and Distributed Systems
Problems with Comparing Interconnection Networks: Is an Alligator Better Than an Armadillo?
IEEE Parallel & Distributed Technology: Systems & Technology
3-disjoint gamma interconnection networks
Journal of Systems and Software
Designing A Disjoint Paths Interconnection Network with Fault Tolerance and Collision Solving
The Journal of Supercomputing
The Journal of Supercomputing
Modified composite Banyan network with an enhanced terminal reliability
Computer Communications
| Hi-index | 14.98 |
A 'state model' is proposed for solving the problem of routing and rerouting messages in the inverse augmented data manipulator (IADM) network. Necessary and sufficient conditions the reroutability of messages are established using this model, and destination tag schemes are derived. These schemes are simpler, more efficient, and require less complex hardware than previously proposed routing schemes. Two destination tag schemes are proposed. A universal rerouting algorithm is constructed based on one of the schemes. It finds a blockage-free path for any combination of multiple blockages if there exists such a path, and indicates the absence of such a path if there exists none. In addition, the state model is used to derive constructively a lower bound on the number of subgraphs which are isomorphic to the indirect binary n-cube network in the IADM network. This knowledge can be used to characterize properties of the IADM networks and for permutation routing in the IADM networks.