The ip–p Rearrangement and Failure-Tolerance of Double p-ary Multirings and Generalized Hypercubes

Authors:
V. S. Podlazov
Affiliations:
Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia
Venue:
Automation and Remote Control
Year:
2002

Citing 6
Cited 1

Counterexample to a conjecture of Szymanski on hypercube routing

Information Processing Letters
Design Principles for Practical Self-Routing Nonblocking Switching Networks with O(N · log N) Bit-Complexity

IEEE Transactions on Computers
Routing a permutation in the hypercube by two sets of edge disjoint paths

Journal of Parallel and Distributed Computing
Nonblocking Conditions for Multiring Commutators and Generalized Hypercubes in Arbitrary Commutations. I. Internodal Commutation. Multirings

Automation and Remote Control
Nonblocking Conditions for Multiring Commutators and Generalized Hypercubes for Arbitrary Commutations. II. Generalized Hypercubes. Intranode Commutation

Automation and Remote Control
A Survey of Wormhole Routing Techniques in Direct Networks

Computer

Crossed Rings—Small-diameter Multiring Switches and Their 1-1-Rearrangeability

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that an arbitrary grouped ip-element permutation can be implemented in a conflict-free way through the commutation of channels on the double ip-ary multiring or the double ip-ary hypercube. It is revealed that in arbitrary single-element permutations, these commutators display the property of the i(p - 1)-nodal failure-tolerance and the generalized hypercube displays in addition the property of the i(p - 1)-channel failure-tolerance.