Skip to main content
SpringerLink
Log in

Is the shuffle-exchange better than the butterfly?

  • Conference paper
  • First Online:
ISA'91 Algorithms (ISA 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 557))

Included in the following conference series:

Abstract

This paper deals with the relative powers of two popular interconnection networks, the butterfly and the shuffle-exchange. Under a certain model of comparison, we show that the shuffle-exchange is no worse than the butterfly. While we do not have concrete evidence that the shuffle-exchange is strictly superior to the butterfly under this model, we isolate a “shuffle-exchange-like” graph that is strictly superior to the butterfly.

The work of this author was supported in part by the National Science Foundation under grant CCR-9107847

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Bhatt, F. Chung, F. Leighton, A. Rosenberg. Optimal Simulations of Tree Machines. Proc. IEEE Symp. on Found. of Comp. Science, 1986.

    Google Scholar 

  2. S. Bhatt, F. Chung, J. Hong, F. T. Leighton, A. L. Rosenberg. Optimal Simulations by Butterfly Networks. ACM Symp. on the Theory of Computing, 1988.

    Google Scholar 

  3. A. Despain and D. Patterson X-Tree — A Tree Structured Multiprocessor Architecture. 5th Symp. on Computer Architecture, 1978

    Google Scholar 

  4. J. Hong, K. Mehlhorn and A. Rosenberg. Cost Tradeoffs in Graph Embeddings, with Applications. J. ACM, 1983.

    Google Scholar 

  5. R. Koch, T. Leighton, B. Maggs, S. Rao and A. Rosenberg. Work-Preserving Emulations of Fixed-Connection Networks. ACM Symposium on Theory of Computing, 1989.

    Google Scholar 

  6. B. Monien and I.H. Sudborough. Simulating Binary Trees on Hypercubes. AWOC, 1988.

    Google Scholar 

  7. F. Preparata and J. Vuillemin. The Cube-Connected Cycles: a Versatile Network for Parallel Computation Communications of the ACM, 1981.

    Google Scholar 

  8. A. Rosenberg. GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions. AWOC, 1988.

    Google Scholar 

  9. J.D. Ullman. Computational Aspects of VLSI Computer Science Press, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Computer Science, University of California, 95616, Davis, CA

    Arvind Raghunathan

  2. Indian Institute of Technology, Delhi

    Huzur Saran

Authors
  1. Arvind Raghunathan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Huzur Saran
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wen-Lian Hsu R. C. T. Lee

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Raghunathan, A., Saran, H. (1991). Is the shuffle-exchange better than the butterfly?. In: Hsu, WL., Lee, R.C.T. (eds) ISA'91 Algorithms. ISA 1991. Lecture Notes in Computer Science, vol 557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54945-5_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-54945-5_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54945-1

  • Online ISBN: 978-3-540-46600-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation