This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Centralized Algorithms for Store-And-Forward Deadlock Avoidance
November 1994 (vol. 43 no. 11)
pp. 1333-1338

A problem of deadlock avoidance in store-and-forward networks with at least two buffers per node is considered for fixed as well as dynamic routing. For both cases polynomial time, centralized deadlock avoidance algorithms are proposed and shown to be optimal in a sense of possible buffer utilization. When the number of buffers is equal to one for each node the problem is known to be NP-complete, thus, unlikely to admit a polynomial-time algorithm. The presented results may be also interesting for other applications, some massively parallel computer systems being one of the examples.

[1] C. Arbib, G. F. Italiano, and A. Panconesi, "Predicting deadlock in store-and-forward networks,"Networks, vol. 20, pp. 861-881, Aug. 1990.
[2] B. Awerbuch, S. Kutten, and D. Peleg, "Efficient deadlock-free routing," inProc. Tenth Annu. ACM Symp. Principles of Distrib. Computing, Montreal, Canada, 1991, 177-188.
[3] J. Blazewicz and D. P. Bovet, "Detection and avoidance of deadlock in store-and-forward communication networks," inPerformance'81, 1981, 503-510.
[4] J. Blazewicz, D. P. Bovet, and G. Gambosi, "Deadlock resistant flow control procedures for store-and-forward networks,"IEEE Trans. Commun., vol. COM-32, pp. 884-887, Aug. 1984.
[5] J. Blazewicz, J. Brzezniski, and G. Gambosi, "Time-stamp approach to store-and-forward deadlock prevention,"IEEE Trans. Commun., vol. COM-35, no. 5, pp. 490-495, May 1987.
[6] C. Chan and T. Yum, "An algorithm for detecting and resolving store-and-forward deadlocks in packed switched networks," inICC-86, 1986, pp. 114-118.
[7] K. M. Chandy, J. Misra, and L. M. Haas, "Distributed deadlock detection,"ACM Trans. Comput. Syst., vol. 1, no. 2, pp. 144-156, May 1983.
[8] J. Cidon, J. Jaffe, and M. Sidi, "Global distributed deadlock detection and resolution with finite buffers," inICC-86, 1986, pp. 124-128.
[9] S. A. Cook, "The complexity of theorem-proving procedures," inProc. 3rd Annu. ACM Symp. Theory of Comput., 1971, pp. 151-158.
[10] B. Cypher and D. Gavano, "Requirements for deadlock-free, adaptive packet routing, " inProc. 11th ACM Symp. Principles of Distrib. Computing, 1992, pp. 25-33.
[11] B. Gavish, P. M. Merlin, and P. J. Schweitzer, "Minimal buffer requirements for avoiding store-and-forward deadlock," unpublished manuscript.
[12] D. Gelernter, "A DAG-based algorithm for prevention of store-and-forward deadlock in packet networks,"IEEE Trans. Comput., vol. C-30, pp. 709-715, Oct. 1981.
[13] M. Gerla and L. Kleinrock, "Flow control, a comparative study,"IEEE Trans. Commun., vol. COM-28, pp. 553-574, Apr. 1980.
[14] M. E. Gold, "Deadlock prediction: Easy and difficult cases,"SIAM J. Comput., vol. 7, pp. 320-336, Aug. 1978.
[15] K. D. Gunther, "Prevention of deadlocks in packet-switched data transport systems,"IEEE Trans. Commun., vol. COM-29, no. 4, pp. 512-524, Apr. 1981.
[16] J. M. Jaffe and M. Sidi, "Distributed deadlock resolution in store-and-forward networks,"Algorithmica, vol. 4, no. 3, pp. 417-436, 1989.
[17] D. B. Lomet, "A practical deadlock avoidance algorithm for data base systems," inProc. ACM-SIGMOD Conf. Managemenet of Data, 1977, pp. 122-127.
[18] D. B. Lomet, "Copying with deadlock in distributed systems,"Data Base Architecture. Amsterdam, The Netherlands: North Holland, 1979, pp. 95-105.
[19] M. Madduri and R. Finkel, "Extension of Banker algorithm for resource allocation in a distributed operating system,"Inf. Processing Lett., vol. 19, no. 1, pp. 1-8, Jan. 1984.
[20] P. M. Merlin and P. J. Schweitzer, "Deadlock avoidance in store-and-forward networks--I: Store-and-forward deadlock,"IEEE Trans. Commun., vol. COM-28, pp. 345-354, Mar. 1980.
[21] R. Raubold and J. Hänle, "A method of deadlock free resource allocation and flow control in packet networks," inProc. ICCC, 1976, 483-487.
[22] M. Raynal,Distributed Algorithms and Protocols. New York: Wiley, 1988.
[23] M. Sherman and H. Rudin, "Using automated validation techniques to detect lockups in packet switched networks,"IEEE Trans. Commun., vol. COM-30, pp. 1762-1767, July 1982.
[24] M. Singhal, "Deadlock detection in distributed systems,"IEEE Comput., vol. 22, pp. 37-48, 1989.
[25] A. S. Tanenbaum,Modern Operating Systems. Englewood Cliffs, NJ: Prentice Hall, Inc., 1992.
[26] S. Toueg and K. Steiglitz, "Some complexity results in the design of deadlock free switching networks,"SIAM J. Comput., vol. 10, pp. 702-712, Nov. 1981.
[27] S. Toueg and J. D. Ullman, "Deadlock free packet switching networks,"SIAM J. Comput., vol. 10, pp. 594-611, Aug. 1981.

Index Terms:
buffer storage; concurrency control; computational complexity; distributed algorithms; store-and-forward deadlock avoidance; store-and-forward networks; dynamic routing; polynomial time; buffer utilization; massively parallel computer systems; complexity analysis.
Citation:
J. Blazewicz, D.P. Bovet, J. Brzezinski, G. Gambosi, M. Talamo, "Optimal Centralized Algorithms for Store-And-Forward Deadlock Avoidance," IEEE Transactions on Computers, vol. 43, no. 11, pp. 1333-1338, Nov. 1994, doi:10.1109/12.324567
Usage of this product signifies your acceptance of the Terms of Use.