Skip to main content
SpringerLink
Log in

kd-Clos: New No-Blocking Permutation Network

  • Conference paper
Book cover Advanced Parallel Processing Technologies (APPT 2003)

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

Included in the following conference series:

  • 538 Accesses

Abstract

In this paper a new no-blocking network named kd-Clos (k-dimension Clos network) is proposed. For different size of the network, we can select different k, the hardware cost is much lower than Clos networks. The routing algorithm for permutation on kd-Clos network is also proposed and the time complexity of the algorithm is O(log3 N) which is same as previous works on Clos network.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Feng, T., Seo, S.: A New Routing Algorithm for a Class of Rearrangeable Networks. IEEE Trans.Computers 43(11) (November 1994)

    Google Scholar 

  2. Clos, C.: A Study of Non-blocking Switch Networks. Bell Syst. Tech. J., 406–424 (1953)

    Google Scholar 

  3. Kang, M.-K., Yi, J.-H., Chang, Y.-S., Kyung, C.-M.: Switch Expansion Architecture Using Local Switching Network. In: IEEE International Conference on Communications, June 18–22, vol. 3, pp. 1426–1429 (2000)

    Google Scholar 

  4. Yang, Y., Masson, G.M.: The Necessary Condition for Clos-Type Nonblocking Multicast Networks. IEEE Transactions on Computers 48, 1214–1227 (1999)

    Article  MathSciNet  Google Scholar 

  5. Lev, G.F., Pippenger, N., Valiant, L.G.: A fast parallel algorithm for routing in permutation networks. IEEE Trans.Computer C-30, 93–100 (1981)

    MathSciNet  Google Scholar 

  6. Yang, Y., Wang, J.: Wide-Sense No blocking Clos Networks under Packing Strategy. IEEE Trans. Computers 48(3), 265–284 (1999)

    Article  Google Scholar 

  7. Yang, Y.: A Class of Interconnection Networks for Multicasting. IEEE Trans. Computers 47(8), 899–906 (1998)

    Article  Google Scholar 

  8. Itoh, A., et al.: Practical Implementation and Packaging Technologies for a Large-Scale ATM Switching System. IEEE J. Selected Areas in Comm. 9(8), 1280–1288 (1991)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China, 100080

    Mei Ming, Dong Li & Bo Fu

Authors
  1. Mei Ming
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bo Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. PDL, National University of Defense Technology, 410073, Changsha, China

    Xingming Zhou

  2. Department of Network Engineering, School of Computer Science, National University of Defense Technology, 410073, Changsha, China

    Ming Xu

  3. Fraunhofer FIRST, Kekuléstr. 7, D-12489, Berlin, Germany

    Stefan Jähnichen

  4. Department of Computing, Hong Kong Polytechnic University, Kowloon, Hong Kong, China

    Jiannong Cao

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ming, M., Li, D., Fu, B. (2003). kd-Clos: New No-Blocking Permutation Network. In: Zhou, X., Xu, M., Jähnichen, S., Cao, J. (eds) Advanced Parallel Processing Technologies. APPT 2003. Lecture Notes in Computer Science, vol 2834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39425-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39425-9_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20054-3

  • Online ISBN: 978-3-540-39425-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation