A modular algorithm for resource allocation

Distributed Computing

Volumn 11, Issue 3, 1998, Pages 157-168

  Rhee, Injong ^a,b,c,d,e  

^a North Carolina State University   (United States)

^b Kyungpook National University   (South Korea)

^c UNIVERSITY OF NORTH CAROLINA   (United States)

^d UNIVERSITY OF WARWICK   (United Kingdom)

^e EMORY UNIVERSITY   (United States)

Author keywords

Concurrency; Dining philosophers; Message passing distributed systems; Modular construction; Resource allocation

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; RESOURCE ALLOCATION; RESPONSE TIME (COMPUTER SYSTEMS); STORAGE ALLOCATION (COMPUTER); SUBROUTINES;

MESSAGE PASSING DISTRIBUTED SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0032131469     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050047     Document Type: Article

References (14)

1. Awerbuch B, Saks M: A dining philosophers algorithm with polynomial response time, Proc. 31st IEEE Symposium on Foundations of Computer Science, St. Louis, MO, pp. 65-74, October 1990.
2. Bar-Ilan J, Peleg D: Distributed resource allocation algorithms, Proc. 6th International Workshop on Distributed Algorithms. pp. 277-291, September 1992
3. Chandy K, Misra J: The drinking philosophers problem, ACM Transactions on Programming Languages, Systems 6: 632-646 (1984)
4. Choy M, Singh A: Efficient fault-tolerant algorithms for resource allocation in distributed systems, Proc. 24th ACM Symposium on Theory of Computing, pp 593-602, May 1992. Also to appear in ACM Transactions on Programming Languages, Systems
5. Choy M, Singh A: Efficient fault-tolerant algorithms for resource allocation in distributed systems, Proc. 24th ACM Symposium on Theory of Computing, pp 593-602, May 1992. Also to appear in ACM Transactions on Programming Languages, Systems
6. Choy M, Singh A: Distributed job scheduling using snapshots, Proc. of the 7th International Workshop on Distributed Algorithms. , pp. 145-159, September 1993
7. Dijkstra E: ierarchical ordering of sequential processes, Acta Informatica 1(2): 115-138 (1971)
8. Lynch N: Upper bounds for static resource allocation in a distributed system, J Comput Syst Sci 23: 254-278 (1981)
9. Peterson G, Fisher M: Economical solutions for the critical section problem in a distributed system, Proc. 9th ACM Symposium on Theory of Computing, pp 91-97, May 1977
10. Page I, Jacob R, Chern S: Fast algorithms for distributed resource allocation, IEEE Tram Parallel Distrib Syst. pp 632-646 (1993)
11. Rhee I: Efficiency of Partial Synchrony, Resource Allocation in Distributed Systems, PhD Dissertation, TR94-071, Department of Computer Science, University of North Carolina, Chapel Hill, April 1994 (ftp://ftp.cs.une.edu/pub/technical-reports/94-071. ps. Z)
12. Styer E, Peterson G: Improved algorithms for distributed resource allocation, Proc. 7th ACM Symposium on Principles of Distributed Computing, Toronto, Canada, pp 105-116, August 1988.
13. Welch J, Lynch N: A modular drinking philosophers algorithm, Distrib Comput 6: 233-244 (1993)
14. Weidman E, Page I, Pervin W: Explicit dynamic exclusion algorithm, Proc. of the 3rd IEEE Symposium on Parallel, Distributed Processing, pp 142-149, December 1991