Skip to main content
SpringerLink
Log in
Book cover

Theory Is Forever pp 250–258Cite as

Some Properties of Multistage Interconnection Networks

  • Chapter

  • 310 Accesses

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

Abstract

In a previous paper [Pa2002] the author developed a theory of decomposition into prime factors of multistage interconnection network. Based on that theory some new properties of such networks are investigated and proved.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Even, S., Litman, A.: Layered Cross Product—A Technique to Construct Interconnection Networks. Networks 29, 219–223 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Lawrie, D.H.: Access and Alignment of Data in an Array Processor. IEEE Trans. Computers C24, 1145–1155 (1975)

    Article  MathSciNet  Google Scholar 

  3. Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes. Morgan Kaufman Publ., San Mateo (1992)

    MATH  Google Scholar 

  4. Paz, A.: A Theory of Decomposition into Prime Factor of Layered Interconnection Networks—a New Version, technical report #892, Computer Science Dept., Technion—IIT (April 2002)

    Google Scholar 

  5. Wu, C., Feng, T.: On a Class of Multistage Interconnection networks. IEEE Trans. Computers C29, 694–702 (1980)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Technion—IIT and The Netanya Academic College, Haifa, 32000, Israel

    Azaria Paz

Authors
  1. Azaria Paz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  2. Institute for Information Systems and Computer Media (IICM), Graz University of Technology, A-8010, Graz, Austria

    Hermann Maurer

  3. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, Bucureşti, Romania

    Gheorghe Păun

  4. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Paz, A. (2004). Some Properties of Multistage Interconnection Networks. In: Karhumäki, J., Maurer, H., Păun, G., Rozenberg, G. (eds) Theory Is Forever. Lecture Notes in Computer Science, vol 3113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27812-2_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27812-2_22

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-27812-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation