Skip to main content
SpringerLink
Log in

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

  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Veselovskii, G.G., Karavai, M.F., and Kuznechik, S.M., Commutation Networks in Multiprocessor Computing Systems with Common Control, Avtom.Telemekh., 1989, no. 2, pp. 3–29.

  2. Lubiw, A., Counterexample to a Conjecture of Szymanski on Hypercube Routing, Inform., Proc.Let., 1990, vol. 35 (2), pp. 57–61.

    Google Scholar 

  3. Gu, Q.P. and Tamaki, H., Routing a Permutation in Hypercube by Two Sets of Edgedisjoint Paths, J.Parallel Distrib.Comput., 1997, vol. 44, no. 2, pp. 147–152.

    Google Scholar 

  4. Karavai, M.F., An Invariant-Group Approach to Investigation of k-Stable Structures, Avtom.Telemekh., no. 1, pp. 144–156.

  5. Andersen, S., The Looping Algorithm Extended to Base 2t Rearrangeable Switching Networks, IEEE Trans.Commun., 1977, vol. COM-25, no. 10, pp. 1057–1063.

    Google Scholar 

  6. Lev, G.F., Pippenger, N., and Valiant, L.G., A Fast Parallel Algorithm for Routing in Permutation Networks, IEEE Trans.Comput., 1981, vol. C-30, no. 2, pp. 93–100.

    Google Scholar 

  7. Nassimi, O. and Sahni, S., Parallel Algorithms to Set up Benes Permutation Network, IEEE Trans.Comput., 1982, vol. C-31, no. 2, pp. 148–154.

    Google Scholar 

  8. Guide to Mytinet-2000 Switches and Switch Networks, http://www.myti.com/myrinet/m3switch/guide/.

  9. Veselovskii, G.G. and Kupriyanova, M.V., Analysis of Some Combinatorial Properties of a Binary Hypercube, Avtom.Telemekh., 1997, no. 8, pp. 178–187.

  10. Szymanski, T.H., Design Principles for Practical Self-Routing Nonblocking Switching Networks with O(N × logN) Bit-Complexity, IEEE Trans.Comput., 1997, vol. C-46, no. 10, pp. 1057–1069.

    Google Scholar 

  11. Ni, L.M. and McKinley, P.K., A Survey of Wormhole Routing Techniques in Direct Networks, IEEE Comput., vol. 26, no. 2, pp. 62–73.

  12. Kermani, P. and Kleinrock, L., Virtual Cut-Through: A New Computer Communication Switching Technique, Comput.Networks, 1979, vol. 3, no. 4, pp. 267–286.

    Google Scholar 

  13. Podlazov, V.S., Unblocking Conditions of Multiring Commutators and Generalized Hypercubes in Arbitrary Permutations. Part I, Avtom.Telemekh., 2001, no. 8, pp. 118–126.

  14. Podlazov, V.S., Unblocking Conditions of Multiring Commutators and Generalized Hypercubes in Arbitrary Permutations. Part II, Avtom.Telemekh., 2001, no. 9, pp. 114–124.

Download references

Author information

Authors and Affiliations

  1. Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia

    V. S. Podlazov

Authors
  1. V. S. Podlazov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Podlazov, V.S. The p–p Rearrangement and Failure-Tolerance of Double p-ary Multirings and Generalized Hypercubes. Automation and Remote Control 63, 1163–1172 (2002). https://doi.org/10.1023/A:1016119201018

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016119201018

Keywords

Search

Navigation