Skip to main content
SpringerLink
Log in

On Message-Dependent Deadlocks in Multiprocessor/Multicomputer Systems

  • Conference paper
  • First Online:
High Performance Computing — HiPC 2000 (HiPC 2000)

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

Included in the following conference series:

Abstract

The existence of multiple message types and associated intermessage dependencies in multiprocessor/multicomputer systems may cause message-dependent deadlock in networks that are designed to be free of routing deadlock. In this paper, we characterize the frequency of message-dependent deadlocks using empirical methods. Results show that message-dependent deadlocks occur very infrequently under typical circumstances, thus rendering approaches based on avoiding them overly restrictive in the common case.

This research was supported in part by an NSF Career Award, grant ECS-9624251, and an NSF grant, CCR-9812137.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  Google Scholar 

  2. L. Schwiebert and D. N. Jayasimha. A Necessary and Sufficient Condition for Deadlock-free Wormhole Routing. Journal of Parallel and Distributed Computing, 32(1):103–117, January 1996.

    Article  Google Scholar 

  3. Timothy Mark Pinkston. Flexible and Efficient Routing Based on Progressive Deadlock Recovery. IEEE Transactions on Computers, 48(7):649–669, July 1999.

    Article  Google Scholar 

  4. Sugath Warnakulasuriya and Timothy Mark Pinkston. A Formal Model of Message Blocking and Deadlock Resolution in Interconnection Networks. IEEE Transactions on Parallel and Distributed Systems, 11(3):212–229, March 2000.

    Article  Google Scholar 

  5. L. Widdoes Jr. and S. Correll. The S-1 Project: Developing High Performance Computers. In Proc. COMPCON, pages 282–291, Spring 1980.

    Google Scholar 

  6. L. M. Censier and P. Feautrier. A New Solution to Coherence Problems in Multicache Systems. IEEE Transactions on Computers, C-27:1112–1118, December 1978.

    Google Scholar 

  7. C. B. Stunkel et al. The SP2 high-performance switch. IBM Systems Journal, 34(2):185–204, 1995.

    Article  Google Scholar 

  8. W. Dally and C. Seitz. Deadlock-free Message Routing in Multiprocessor Interconnection Net works. IEEE Transactions on Computers, 36(5):547–553, May 1987.

    Article  MATH  Google Scholar 

  9. Charles E. Leiserson, Zahi S. Abuhamdeh, David C. Douglas, Carl R. Feynman, Mahesh N. Ganmukhi, Jeffrey V. Hill, W. Daniel Hillis, Bradley C. Kuszmaul, Margaret A. St. Pierre, David S. Wells, Monica C. Wong, Shaw-Wen Yang, and Robert Zak. The Network Architecture of the Connection Machine CM-5. In Symposium on Parallel and Distributed Algorithms, pages 272–285, 1992.

    Google Scholar 

  10. Joseph Carbonaro. Cavallino: The Teraflops Router and NIC. In Proceedings of the Symposium on Hot Interconnects IV, pages 157–160. IEEE Computer Society, August 1996.

    Google Scholar 

  11. Sugath Warnakulasuriya and Timothy Mark Pinkston. Characterization of Deadlocks in k-ary n-cube Networks. IEEE Transactions on Parallel and Distributed Systems, to appear, 1999.

    Google Scholar 

  12. James Laudon and Daniel Lenoski. The SGI Origin: A ccNUMA Highly Scalable Server. In Proceedings of the 24th International Symposium on Computer Architecture, pages 241–251. IEEE Computer Society, June 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SMART Interconnects Group, University of Southern California, 90089-2562, Los Angeles, CA, USA

    Yong Ho Song & Timothy Mark Pinkston

Authors
  1. Yong Ho Song
    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. DAC-UPC,Computer Architecture Department, Technical University of Catalonia, Campus Nord,D6,Jordi Girona,1-3, Barcelona, Spain

    Mateo Valero

  2. Department of EE-Systems Computer Engineering Division, University of Southern California, 3740 McClintok Ave,EEB 200C, 90089-2562, Los Angeles, CA, USA

    Viktor K. Prasanna

  3. Indian Institute of Science, Sir C.V.Raman Avenue, 560012, Bangalore, India

    Sriram Vajapeyam

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Song, Y.H., Pinkston, T.M. (2000). On Message-Dependent Deadlocks in Multiprocessor/Multicomputer Systems. In: Valero, M., Prasanna, V.K., Vajapeyam, S. (eds) High Performance Computing — HiPC 2000. HiPC 2000. Lecture Notes in Computer Science, vol 1970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44467-X_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-44467-X_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41429-2

  • Online ISBN: 978-3-540-44467-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation