Abstract
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.
On leave from Dipartimento di Informatica e Sistemistica, Universita' di Roma "La Sapienza", Roma, Italy.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A.V. Aho, J.E. Hopcroft, J.D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, Reading, 1974.
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.
J. Blazewicz, J. Brzezinski, G. Gambosi, "Time-stamps approach to Store-and-Forward deadlock prevention", IEEE Trans. on Comm., COM-35 (1987), 490–495.
G. Bongiovanni, D.P. Bovet, "Minimal deadlock-free Store-and-forward communication networks", Networks 17 (1987), 187–200.
D.P. Bovet, G. Gambosi, D.A. Menasce, "Detection and removal of deadlocks in Store-and-Forward communication networks", Performance '84.
R.C. Holt, "Some deadlock properties of computer systems", ACM Comp. Surv., 4, no. 3, (1972), pp. 178–196.
L. Kleinrock, Queuing Systems, vol. II: computer applications, John Wiley, New York, 1976.
E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
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.
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.
R.E. Tarjan, "Depth-first search and linear graph algorithms", SIAM J. Comput. 2 (1972), 146–160.
S. Toueg, "Deadlock-and livelock-free packet switching networks", Proc. ACM STOC (1980), 94–108.
S. Toueg, K. Steiglitz, "Some complexity results in the design of deadlock-free packet switching networks", SIAM J. Comput. 10 (1981), 702–712.
S. Toueg, J.D. Ullman, "Deadlock-free packet switching networks", Proc. ACM STOC (1979), 89–98.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arbib, C., Italiano, G.F., Panconesi, A. (1988). Predicting deadlock in store-and-forward networks. In: Nori, K.V., Kumar, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1988. Lecture Notes in Computer Science, vol 338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50517-2_76
Download citation
DOI: https://doi.org/10.1007/3-540-50517-2_76
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50517-4
Online ISBN: 978-3-540-46030-5
eBook Packages: Springer Book Archive