Skip to main content

Entropy Throttling: A Physical Approach for Maximizing Packet Mobility in Interconnection Networks

  • Conference paper
Book cover Advances in Computer Systems Architecture (ACSAC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4186))

Included in the following conference series:

Abstract

A large-scale direct interconnection network usually consists of enormous number of simple routers. However, its behavior is sometimes very complicated. Such a complicated behavior prevents us from accurate understanding and efficient control of the network. Among serious problems in interconnection networks, congestion control is of extreme importance since network performance is drastically degraded by a congested situation. We focus our discussion on throttling, injection limitation in other words, as one of the most hopeful solutions to the congestion problem. Our approach is inspired from physics. We define entropy as a desirable metric for representing the network’s congestion level. We also define packet mobility ratio as a proper approximation of entropy. Thus we reach a new throttling method called ‘Entropy Throttling’ that is based on theoretical discussion on congestion. Evaluation results by our simulator reveal effectiveness of the proposed method.

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

Access this chapter

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. Duato, J., Yalamanchili, S., Ni, L.: Interconnection Networks: An Engineering Approach. Morgan Kaufmann Pub., San Francisco (2003)

    Google Scholar 

  2. Dally, W.J., Towles, B.: Principles and Practices of Interconnection Networks. Morgan Kaufmann Pub., San Francisco (2004)

    Google Scholar 

  3. Yokota, T., Ootsu, K., Furukawa, F., Baba, T.: A Cellular Automata Approach for Large-Scale Interconnection Network Simulation. IEICE Technical Report, CPSY2005–32 (December 2005)

    Google Scholar 

  4. Yokota, T., Ootsu, K., Furukawa, F., Baba, T.: A Cellular Automata Approach for Understanding Congestion in Interconnection Networks. IPSJ Trans. Advanced Computing Systems (to appear, 2006)

    Google Scholar 

  5. Yokota, T., Ootsu, K., Furukawa, F., Baba, T.: Phase Transition Phenomena in Interconnection Networks of Massively Parallel Computers. Journal of Physical Society of Japan 75(7) (to appear, 2006)

    Google Scholar 

  6. Yokota, T., Matsuoka, H., Okamoto, K., Hirono, H., Sakai, S.: Virtual Control Channel and its Application to the Massively Parallel Computer RWC-1. In: Proc. Int. Conf. on High Performance Computing (HiPC 1997), pp. 443–448 (December 1997)

    Google Scholar 

  7. Nishitani, M., Ezura, S., Yokota, T., Ootsu, K., Baba, T.: Preliminary Research of a Novel Routing Algorithm Cross-Line Using Dynaic Information. In: Proc. IASTED PDCS 2004, pp. 107–112 (November 2004)

    Google Scholar 

  8. Yokota, T., Nishitani, M., Ootsu, K., Furukawa, F., Baba, T.: Cross-Line — A Globally Adaptive Control Method of Interconnection Network. In: Proc. ISHPC–VI (September 2005)

    Google Scholar 

  9. Yokota, T., Ootsu, K., Furukawa, F., Baba, T.: Cross-Line: A Novel Routing Algorithm that Uses Global Information. IPSJ Trans. Advanced Computing Systems 46 SIG 16 (ACS 12), 28–42 (2005)

    Google Scholar 

  10. Bernstein, H.J.: Some Comments on Highly Dynamic Network Routing. Tech. Rep. 371, Computer Science Dept., New York Univ. (May 1988)

    Google Scholar 

  11. Baydal, E., López, P., Duato, J.: A Family of Mechanisms for Congestion Control in Wormhole Networks. IEEE Trans. Parallel and Distributed Systems 16(9), 772–784 (2005)

    Article  Google Scholar 

  12. López, P., Martínez, J.M., Duato, J.: DRIL: Dynamically Reduced Message Injection Limitation Mechanism for Wormhole Networks. In: Proc. ICPP 1998, pp. 535–562 (1998)

    Google Scholar 

  13. Obaidat, M.S., Al-Awwami, Z.H., Al-Mulhem, M.: A new injection limitation mechanism for wormhole networks. Computer Communications 25, 997–1008 (2002)

    Article  Google Scholar 

  14. Thottethodi, M., Lebeck, A.R., Mukherjee, S.S.: Self-Tuned Congestion Control for Multiprocessor Networks. In: Proc. HPCA–7, pp. 107–118 (2001)

    Google Scholar 

  15. Thottethodi, M., Lebeck, A.R., Mukherjee, S.S.: Exploiting Global Knowledge to Achieve Self-Tuned Congestion Sontrol for k-Ary n-Cube Networks. IEEE Trans. Parallel and Distributed Systems 15(3), 257–272 (2004)

    Article  Google Scholar 

  16. Baydal, E., López, P., Duato, J.: A Congestion Control Mechanism for Wormhole Networks. In: Proc. 9th Euromicro Workshop on Parallel and Distributed Processing (EUROPDP 2001), pp. 19–26 (February 2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yokota, T., Ootsu, K., Furukawa, F., Baba, T. (2006). Entropy Throttling: A Physical Approach for Maximizing Packet Mobility in Interconnection Networks. In: Jesshope, C., Egan, C. (eds) Advances in Computer Systems Architecture. ACSAC 2006. Lecture Notes in Computer Science, vol 4186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11859802_25

Download citation

  • DOI: https://doi.org/10.1007/11859802_25

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-40058-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics