Skip to main content
SpringerLink
Log in

The shuffle exchange network has a Hamiltonian path

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

We prove the existence of a Hamiltonian path in the Shuffle Exchange networkSX (n). This problem has been posed as an open problem by Leighton in [8] and Samatham and Pradhan in [11]. Its positive solution has several consequences showing the computational abilities of theSX(n).

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. F. Annexstein, M. Baumslag, and A. L. Rosenberg. Group Action Graphs and Parallel Architectures.SIAM Journal of Computing,19, 554–569 (1990).

    Article  MathSciNet  Google Scholar 

  2. H. L. Bodlaender. The Classification of Coverings of Processor Networks.Journal of Parallel and Distributed Computing,6, 166–182 (1989).

    Article  Google Scholar 

  3. G. De Bruijn. A Combinatorial Problem.Indagationes Mathematicae,8, 461–467 (1946).

    Google Scholar 

  4. R. Feldmann and W. Unger. The Cube-Connected Cycles Network Is a Subgraph of the Butterfly Network.Parallel Processing Letters,2, 13–19 (1992).

    Article  Google Scholar 

  5. R. Feldmann, P. Mysliwietz, and S. Tschöke. The Shuffle Exchange Network of Dimension 2d has a Hamiltonian Path. Unpublished manuscript, 1991.

  6. E. N. Gilbert. Gray Codes and Paths on then-Cube.Bell System Technical Journal,37, 815–826 (1957).

    Google Scholar 

  7. R. J. Gould. Updating the Hamiltonian Problem—A Survey.Journal of Graph Theory,15, 121–157 (1991).

    Article  MATH  MathSciNet  Google Scholar 

  8. F. T. Leighton.Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Chapter 3, page 509. Morgan Kaufmann, San Mateo, CA, 1991.

    Google Scholar 

  9. B. Monien and H. Sudborough. Comparing Interconnection Networks.Mathematical Foundations of Computer Science,88, 138–153 (1988).

    MathSciNet  Google Scholar 

  10. F. P. Preparata and J. Vuillemin. The Cube-Connected-Cycles. A Versatile Network for Parallel Computation.Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, pp. 140–147, 1979.

  11. M. R. Samantham and D. K. Pradhan. The DeBruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI.IEEE Transactions on Computers,20, 567–581 (1989).

    Article  Google Scholar 

  12. A. M. Schwartz and M. C. Loui. Dictionary Machines on Cube-Class Networks.IEEE Transactions on Computers,36, 100–105 (1987).

    Article  Google Scholar 

  13. H. S. Stone. Parallel Processing with the Perfect Shuffle.IEEE Transactions on Computers,20, 153–161 (1971).

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Paderborn, Warburger Straβe 100, 4790, Paderborn, Germany

    R. Feldmann & P. Mysliwietz

Authors
  1. R. Feldmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Mysliwietz
    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

Feldmann, R., Mysliwietz, P. The shuffle exchange network has a Hamiltonian path. Math. Systems Theory 29, 471–485 (1996). https://doi.org/10.1007/BF01184811

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01184811

Keywords

Search

Navigation