
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
J. Blazewicz, D.P. Bovet, J. Brzezinski, G. Gambosi, M. Talamo, "Optimal Centralized Algorithms for StoreAndForward Deadlock Avoidance," IEEE Transactions on Computers, vol. 43, no. 11, pp. 13331338, November, 1994.  
BibTex  x  
@article{ 10.1109/12.324567, author = {J. Blazewicz and D.P. Bovet and J. Brzezinski and G. Gambosi and M. Talamo}, title = {Optimal Centralized Algorithms for StoreAndForward Deadlock Avoidance}, journal ={IEEE Transactions on Computers}, volume = {43}, number = {11}, issn = {00189340}, year = {1994}, pages = {13331338}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.324567}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Optimal Centralized Algorithms for StoreAndForward Deadlock Avoidance IS  11 SN  00189340 SP1333 EP1338 EPD  13331338 A1  J. Blazewicz, A1  D.P. Bovet, A1  J. Brzezinski, A1  G. Gambosi, A1  M. Talamo, PY  1994 KW  buffer storage; concurrency control; computational complexity; distributed algorithms; storeandforward deadlock avoidance; storeandforward networks; dynamic routing; polynomial time; buffer utilization; massively parallel computer systems; complexity analysis. VL  43 JA  IEEE Transactions on Computers ER   
A problem of deadlock avoidance in storeandforward 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 NPcomplete, thus, unlikely to admit a polynomialtime 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 storeandforward networks,"Networks, vol. 20, pp. 861881, Aug. 1990.
[2] B. Awerbuch, S. Kutten, and D. Peleg, "Efficient deadlockfree routing," inProc. Tenth Annu. ACM Symp. Principles of Distrib. Computing, Montreal, Canada, 1991, 177188.
[3] J. Blazewicz and D. P. Bovet, "Detection and avoidance of deadlock in storeandforward communication networks," inPerformance'81, 1981, 503510.
[4] J. Blazewicz, D. P. Bovet, and G. Gambosi, "Deadlock resistant flow control procedures for storeandforward networks,"IEEE Trans. Commun., vol. COM32, pp. 884887, Aug. 1984.
[5] J. Blazewicz, J. Brzezniski, and G. Gambosi, "Timestamp approach to storeandforward deadlock prevention,"IEEE Trans. Commun., vol. COM35, no. 5, pp. 490495, May 1987.
[6] C. Chan and T. Yum, "An algorithm for detecting and resolving storeandforward deadlocks in packed switched networks," inICC86, 1986, pp. 114118.
[7] K. M. Chandy, J. Misra, and L. M. Haas, "Distributed deadlock detection,"ACM Trans. Comput. Syst., vol. 1, no. 2, pp. 144156, May 1983.
[8] J. Cidon, J. Jaffe, and M. Sidi, "Global distributed deadlock detection and resolution with finite buffers," inICC86, 1986, pp. 124128.
[9] S. A. Cook, "The complexity of theoremproving procedures," inProc. 3rd Annu. ACM Symp. Theory of Comput., 1971, pp. 151158.
[10] B. Cypher and D. Gavano, "Requirements for deadlockfree, adaptive packet routing, " inProc. 11th ACM Symp. Principles of Distrib. Computing, 1992, pp. 2533.
[11] B. Gavish, P. M. Merlin, and P. J. Schweitzer, "Minimal buffer requirements for avoiding storeandforward deadlock," unpublished manuscript.
[12] D. Gelernter, "A DAGbased algorithm for prevention of storeandforward deadlock in packet networks,"IEEE Trans. Comput., vol. C30, pp. 709715, Oct. 1981.
[13] M. Gerla and L. Kleinrock, "Flow control, a comparative study,"IEEE Trans. Commun., vol. COM28, pp. 553574, Apr. 1980.
[14] M. E. Gold, "Deadlock prediction: Easy and difficult cases,"SIAM J. Comput., vol. 7, pp. 320336, Aug. 1978.
[15] K. D. Gunther, "Prevention of deadlocks in packetswitched data transport systems,"IEEE Trans. Commun., vol. COM29, no. 4, pp. 512524, Apr. 1981.
[16] J. M. Jaffe and M. Sidi, "Distributed deadlock resolution in storeandforward networks,"Algorithmica, vol. 4, no. 3, pp. 417436, 1989.
[17] D. B. Lomet, "A practical deadlock avoidance algorithm for data base systems," inProc. ACMSIGMOD Conf. Managemenet of Data, 1977, pp. 122127.
[18] D. B. Lomet, "Copying with deadlock in distributed systems,"Data Base Architecture. Amsterdam, The Netherlands: North Holland, 1979, pp. 95105.
[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. 18, Jan. 1984.
[20] P. M. Merlin and P. J. Schweitzer, "Deadlock avoidance in storeandforward networksI: Storeandforward deadlock,"IEEE Trans. Commun., vol. COM28, pp. 345354, 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, 483487.
[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. COM30, pp. 17621767, July 1982.
[24] M. Singhal, "Deadlock detection in distributed systems,"IEEE Comput., vol. 22, pp. 3748, 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. 702712, Nov. 1981.
[27] S. Toueg and J. D. Ullman, "Deadlock free packet switching networks,"SIAM J. Comput., vol. 10, pp. 594611, Aug. 1981.