Distributed algorithms for allocating resources to process groups and their complexity

Systems and Computers in Japan

Volumn 30, Issue 6, 1999, Pages 23-35

  Wada, Yutaka ^a,b   Cheng, Zixue ^a,c,d   Noguchi, Shoichi ^a,c,e  

^a UNIVERSITY OF AIZU   (Japan)

^b IPSJ   (Japan)

^c TOHOKU UNIVERSITY   (Japan)

^d IEEE

^e NIHON UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DEADLOCK-FREE OPERATION; DINING PHILOSOPHERS PROBLEM; DRINKING PHILOSOPHERS PROBLEM; STARVATION-FREE OPERATION;

ALGORITHMS; GRAPH THEORY; RESOURCE ALLOCATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0032631011     PISSN: 08821666     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-684X(19990615)30:6<23::AID-SCJ3>3.0.CO;2-I     Document Type: Article

References (17)

1. Chandy KM, Misra J. The drinking philosophers problem. ACM Trans Prog Language Syst 1984;6:632-646.
2. Barbosa VC. An introduction to distributed algorithms. The MIT Press; 1996.
3. Lynch NA. Distributed algorithms. Morgan-Kaufmann; 1996.
4. Maekawa M. Environment to execution/development of software. The Iwanami Software Series: Iwanami Shoten; 1992.
5. Rhee I. A fast distributed modular algorithm for resource allocation. Proc 15th Int Conf Distributed Comput Syst, May 1995:161-168.
6. Ginat D, Shankar AU, Agrawala AK. An efficient solution to the drinking philosophers problem and its extensions. Proc 3rd Int Workshop on Distributed Algorithms, Lecture Notes in Computer Science, 1989;392:83-93.
7. Kakugawa H, Yamashita M. Local coteries and a distributed resource allocation algorithm. Trans Inf Proc Soc Jpn 1996;37:1487-1496.
8. Lamport L. Time, clock, and ordering of events in a Distributed system. Commun ACM 1978;21:558-565.
9. Hagiwara K, Masuzawa T. Distributed algorithms. Inf Proc Soc Jpn 1990;31:1245-1256.
10. Maekawa M. A √N algorithm for mutual exclusion in decentralized systems. ACM Trans Comput Syst 1985;3:145-159.
11. Raynal M. A distributed solution to the k-out of-M resources allocation problem. LNCS 497, Springer-Verlag, pp. 599-609.
12. M/M+1) distributed algorithm for the k-out of-M resources allocation problem. Proc 14th ICDCS 1994:81-88.
13. Khiat A, Naïmi M. Distributed mutual exclusion in K-groups based on K-logical rings. Proc 11 th Annual Int Symp High Performance Comput Syst, HPCS'97, July 1997:269-282.
14. Bar-Ilan J, Peleg D. Distributed resource allocation algorithms. LNCS 647 1992;277-291.
15. Huang T, Cheng Z. A distributed algorithm for optimal allocation of resources. Proc Int Conf Parallel and Distributed Proc Techniques and Appl (PDPTA'97), July 1997:880-884.
16. Cheng Z, Huang T, Shiratori N. A distributed algorithm for resource allocation among process group. Proc 9th Int Conf Inf Networking, Dec. 1994:443-448.
17. Wada Y, Cheng Z, Huang T. A distributed algorithm for allocation of resources to process groups with acyclic graphs. Proc Int Conf Parallel and Distributed Proc Techniques and Appl (PDPTA'97), July 1997:801-805.