This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fast Algorithms for Distributed Resource Allocation
February 1993 (vol. 4 no. 2)
pp. 188-197

Two new algorithms for the distributed static resource allocation problem are presented.The first algorithm, which shows excellent average case behavior in simulation requiresthe maintenance of a global queue. The second, which needs only local communication,has polynomial waiting time and exhibits better average case behavior than the only otherknown polynomial time algorithm. Both algorithms have polynomial message complexity.

[1] B. Awerbuch and M. Saks, "A dining philosophers algorithm with polynomial response time," inProc. 31st Annu. IEEE Symp. Foundations Comput. Sci., St. Louis, MO, Oct. 1990, pp. 65-74.
[2] K. M. Chandy and J. Misra, "The drinking philosophers problem,"ACM Trans. Programming Lang. Syst., vol. 6, no. 4, pp. 632-646, 1984.
[3] P. J. Courtois, F. Heymans, and D. L. Parnas, "Concurrent control with readers and writers,"Commun. ACM, vol. 14, no. 2, pp. 667- 668, Oct. 1971.
[4] E. W. Dijkstra, "Hierarchical ordering of sequential processes,"Acta Informatica, vol. 1, pp. 115-138, 1971.
[5] N. A. Lynch, "Upper bounds for static resource allocation in a distributed system."J. Comput. and Syst. Sci., vol. 23, pp. 254-278, 1981.
[6] N. A. Lynch and K. J. Goldman, "Distributed algorithms," Technical Publication MIT/LCS/RSS-5, Lab. for Comput. Sci., Massachusetts Instit. of Technol., May 1989.
[7] M. Maekawa, A. E. Oldehoeft, and R. R. Oldehoeft,Operating Systems: Advanced Concepts. Menlo Park, CA: Benjamin/Cummings, 1987.
[8] I. P. Page, S. E. Chern, and R. T. Jacob, "Simulation studies of several algorithms for the dining philosophers problem," Tech. Rep. UTDCS-2- 91, Program in Computer Science, University of Texas at Dallas, Mar. 1991.
[9] E. Styer and G. L. Peterson, "Improved algorithms for distributed resource allocation," inProc. 7th Annu. ACM Symp. Principles of Distributed Computing, Toronto, Canada, Aug. 1988, pp. 105-116.
[10] J. L. Welch and N. A. Lynch, "Synthesis of efficient drinking philosophers algorithms," Technical Publication MIT/LCS/TM-417, Lab. for Comput. Sci., Massachusetts Instit. of Technol., Nov. 1989.

Index Terms:
Index Termsdistributed static resource allocation problem; average case behavior; simulation; globalqueue; polynomial waiting time; polynomial message complexity; computationalcomplexity; distributed processing; resource allocation
Citation:
I. Page, T. Jacob, E. Chern, "Fast Algorithms for Distributed Resource Allocation," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 2, pp. 188-197, Feb. 1993, doi:10.1109/71.207594
Usage of this product signifies your acceptance of the Terms of Use.