A distributed solution to the k-out of-m resources allocation problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 497 LNCS, Issue , 1991, Pages 599-609

  Raynal Irisa, Michel ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

And synchronization; Distributed mutual exclusion; Distributed synchronization; K out of M resources allocation; Permission based algorithms

Indexed keywords

POTASSIUM COMPOUNDS;

DISTRIBUTED MUTUAL EXCLUSION; DISTRIBUTED SOLUTIONS; DISTRIBUTED SYNCHRONIZATION; DISTRIBUTED SYSTEMS; MUTUAL EXCLUSION ALGORITHMS; MUTUAL EXCLUSIONS; RESOURCES ALLOCATION;

RESOURCE ALLOCATION;

EID: 0001904011     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54029-6_209     Document Type: Conference Paper

References (14)

1. CARVALHO O. S. F., ROUCAIROL G. Assertion decomposition and partial correctness of distributed algorithms. In Distributed Computing, (Paker and Verjus Ed.), Academic Press, (1983), pp. 67-93.
2. CARVALHO O. S. F., ROUCAIROL G. On the distribution of an assertion. Proc. of the 2d ACM Sigact-Sigops Symposium on P. O. D. C., (August 1982), pp. 121-131.
3. CHANDY K. M., MISRA J. The drinking philosophers problem. ACM Transactions on Programming Languages and Systems, 6(4):632-646, (1984).
4. HELARY J. M., PLOUZEAU N., RAYNAL M. A distributed algorithm for mutual exclusion in an arbitrary network. The Computer Journal, 31(4): 289-295, (1988).
5. LAMPORT L. Time, clocks and ordering of events in distributed systems, communications of the ACM, 21(7): 558-564, (1978).
6. LE LANN G. Distributed systems: towards a formal approach. IFIP congress, Toronto, (1977), pp. 155-160.
7. MARTIN A. J. Distributed mutual exclusion on a ring of processes. Science of Computer Programming, vol. 5, (1985), pp. 265-276.
8. RAYMOND K. A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems, 7(1): 61-77, (1989).
9. RAYMOND K. A distributed algorithm for multiple entries to a critical section. Inf. Processing Letters, vol. 30, (1989), pp. 189-193.
10. RAYNAL M. Algorithms for mutual exclusion. MIT Press, (1986), 107 p.
11. RAYNAL M. Distributed computations and networks: concepts, tools and algorithms. MIT Press, (1988), 160 p.
12. RICART G., AGRAWALA A. K. An optimal algorithm for mutual exclusion in computer networks. Communication of the ACM, 24(1): 9-17, (1981).
13. SANDERS B. The information structure of distributed mutual exclusion algorithms. ACM Transactions on Computer Systems, 5(3): 284-299, (1987).
14. Van De SNEPSCHEUT J. L. Fair mutual exclusion on a graph of processes. Distributed Computing, 2: 113-115, (1987).