Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Parallel Computer Routing and Communication

PCRCW 1997: Parallel Computer Routing and Communication pp 275–293Cite as

Modeling Message Blocking and Deadlock in Interconnection Networks

  • Conference paper
  • First Online:

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

Abstract

This paper presents an approach to modeling resource al- locations and dependencies within cut-through and wormhole intercon- nection networks. This model allows various types of message blocking to be represented precisely, including deadlock. Our model of deadlock distinguishes between messages involved in deadlock and those simply dependent on deadlock, thus providing specification criteria for precise deadlock detection and recovery. The model and its implementation in a network simulator are described. Time and space complexity of the implementation is also discussed.

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   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Sugath Warnakulasuriya and Timothy Mark Pinkston. “Characterization of Dead-locks in Interconnection Networks”, In Proc. of the 11th International Parallel Processing Symposium, pp 80–86, April 1997.

    Google Scholar 

  2. Timothy Mark Pinkston and Sugath Warnakulasuriya. “On Deadlocks in Interconnection Networks”, In Proc. of the 24th International Symposium on Computer Architecture, pp 38–49, June 1997.

    Google Scholar 

  3. D. Reeves, E. Gehringer, and A. Chandiramani. “Adaptive Routing and Deadlock Recovery: A Simulation Study”, In Proceedings of the 4th Conference on Hypercube Concurrent Computers and Applications, 1989.

    Google Scholar 

  4. J. Kim, Z. Liu, and A. Chien. “Compressionless Routing: A Framework for Adaptive and Fault-tolerant Routing”. In IEEE Transactions on Parallel and Distributed Systems, 8(3):229–244, March 1997.

    Google Scholar 

  5. Anjan K.V. and Timothy M. Pinkston, “An Efficient, Fully Adaptive Deadlock Recovery Scheme: Disha”, In Proc. of the 22nd International Symposium on Computer Architecture, pp 201–210, June 1995.

    Google Scholar 

  6. Anjan K.V., Timothy M. Pinkston, and Jose Duato, “Generalized Theory for Deadlock-Free Adaptive Wormhole Routing and its Application to Disha Concurrent”, In Proc. of the 10th International Parallel Processing Symposium, pp 815–821, April 1996.

    Google Scholar 

  7. L. Ni and C. Glass, “The Turn Model for Adaptive Routing”, In Proc. of the 19th International Symposium on Computer Architecture, IEEE Computer Society, pages 278–287, May 1992.

    Google Scholar 

  8. Andrew A. Chien and J. H. Kim. “Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors”. In Proc. of the 19th Symposium on Computer Architecture, pp 268–277, May 1992.

    Google Scholar 

  9. J. Duato. “A New Theory of Deadlock-free Adaptive Routing in Wormhole Networks”. IEEE Transactions on Parallel and Distributed Systems, 4(12):1320–1331, December 1993.

    Google Scholar 

  10. J. Duato. “A Necessary and Sufficient Condition for Deadlock-free Adaptive Routing in Wormhole Networks”. IEEE Transactions on Parallel and Distributed Systems, 6(10):1055–1067, October 1995.

    Google Scholar 

  11. J. Duato, S. Yalamanchili, and L. Ni. “Interconnection Networks: An Engineering Approach”. IEEE Computer Society Press, 1997.

    Google Scholar 

  12. Sugath Warnakulasuriya and Timothy Mark Pinkston. “Implementation of Dead-lock Detection in a Simulated Interconnection Network Environment”, Technical Report CENG 97-01, University of Southern California, January 1997.

    Google Scholar 

  13. William J. Dally and Hiromichi Aoki, “Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels”, IEEE Transactions on Parallel Distributed Systems, Vol. 4, No. 4, April, 1993.

    Google Scholar 

  14. Loren Schwiebert, D.N. Jayasimha, “A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing”, Journal of Parallel and Distributed Computing, 32, 103–117 (1996).

    Article  Google Scholar 

  15. Mamoru Maekawa, Arthur E. Oldehoft, and Rodney R. Oldehoft, “Operating Systems: Advanced Concepts”, Benjamin Cummings Publishing Company, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SMART Interconnects Group Electrical Engineering - Systems Department, University of Southern California, 3740 McClintock Avenue, EEB-208, Los Angeles, CA, 90089-2562

    Sugath Warnakulasuriya & Timothy Mark Pinkston

Authors
  1. Sugath Warnakulasuriya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Timothy Mark Pinkston
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology, School of Electrical and Computer Science, Atlanta, Georgia, 30332-0250, USA

    Sudhakar Yalamanchili

  2. Facultad de Informàtica, Universidad Politécnica de Valencia, Camino de Vera s/n, E-46071, Valencia, Spain

    José Duato

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Warnakulasuriya, S., Pinkston, T.M. (1998). Modeling Message Blocking and Deadlock in Interconnection Networks. In: Yalamanchili, S., Duato, J. (eds) Parallel Computer Routing and Communication. PCRCW 1997. Lecture Notes in Computer Science, vol 1417. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69352-1_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-69352-1_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64571-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation