Predicting deadlock in store-and-forward networks

  • Claudio Arbib
  • Giuseppe F. Italiano
  • Alessandro Panconesi
Session 4 Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 338)


Aim of this paper is to study the complexity of the Deadlock-Safety problem for Store-and-Forward networks. The following results are shown: 1. the problem is in general NP-complete, even for tree-like networks. It is still NP-complete for various "simple" topologies (including bipartite, grid and two-terminals series-parallel graphs) when each vertex buffer is of unit capacity; 2. the problem is solvable in PTIME for 1-buffer tree-like networks.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A.V. Aho, J.E. Hopcroft, J.D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, Reading, 1974.Google Scholar
  2. [2]
    J. Blazewicz, D.P. Bovet, G. Gambosi, "Deadlock-resistant flow control procedures for Store-and-Forward networks", IEEE Trans. on Comm., COM-32 (1984), 884–887.Google Scholar
  3. [3]
    J. Blazewicz, J. Brzezinski, G. Gambosi, "Time-stamps approach to Store-and-Forward deadlock prevention", IEEE Trans. on Comm., COM-35 (1987), 490–495.Google Scholar
  4. [4]
    G. Bongiovanni, D.P. Bovet, "Minimal deadlock-free Store-and-forward communication networks", Networks 17 (1987), 187–200.Google Scholar
  5. [5]
    D.P. Bovet, G. Gambosi, D.A. Menasce, "Detection and removal of deadlocks in Store-and-Forward communication networks", Performance '84.Google Scholar
  6. [6]
    R.C. Holt, "Some deadlock properties of computer systems", ACM Comp. Surv., 4, no. 3, (1972), pp. 178–196.Google Scholar
  7. [7]
    L. Kleinrock, Queuing Systems, vol. II: computer applications, John Wiley, New York, 1976.Google Scholar
  8. [8]
    E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.Google Scholar
  9. [9]
    P.M. Merlin, P.J. Schweitzer, "Deadlock avoidance in Store-and-Forward networks I: Store-and-Forward deadlock", IEEE Trans. on Comm., COM-28 n. 3 (1980), 345–354.Google Scholar
  10. [10]
    P.M. Merlin, P.J. Schweitzer, "Deadlock avoidance in Store-and-Forward networks II: other deadlock types", IEEE Trans. on Comm., COM-28 n. 3 (1980), 355–360.Google Scholar
  11. [11]
    R.E. Tarjan, "Depth-first search and linear graph algorithms", SIAM J. Comput. 2 (1972), 146–160.Google Scholar
  12. [12]
    S. Toueg, "Deadlock-and livelock-free packet switching networks", Proc. ACM STOC (1980), 94–108.Google Scholar
  13. [13]
    S. Toueg, K. Steiglitz, "Some complexity results in the design of deadlock-free packet switching networks", SIAM J. Comput. 10 (1981), 702–712.Google Scholar
  14. [14]
    S. Toueg, J.D. Ullman, "Deadlock-free packet switching networks", Proc. ACM STOC (1979), 89–98.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Claudio Arbib
    • 1
  • Giuseppe F. Italiano
    • 2
  • Alessandro Panconesi
    • 3
  1. 1.Dipartimento di ElettronicaUniversita' di Roma "Tor Vergata"RomaItaly
  2. 2.Department of Computer ScienceColumbia UniversityNew YorkUSA
  3. 3.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations