Name
Abstract | ||
|---|---|---|
In this paper, we present the first self-stabilizing solution to the k out of l exclusion problem [14] on a ring. The k out of l exclusion problem is a generalization of the well-known mutual exclusion problem -- there are l units of the shared resources, any process can request some number k (1 驴 k 驴 l) of units of the shared resources, and no resource unit is allocated to more than one process at one time. The space requirement of the proposed algorithm is independent of l for all processors except a special processor, called Root. The stabilization time of the algorithm is only 5n, where n is the size of the ring. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/3-540-45706-2_76 | Concurrency and Computation: Practice and Experience |
Keywords | Field | DocType |
well-known mutual exclusion problem,resource unit,l exclusion problem,stabilization time,number k,exclusion algorithm,self-stabilizing solution,self-stabilizing token-based k-out-of-l,l unit,space requirement,proposed algorithm,shared resource,mutual exclusion | Computer science,Parallel computing,Algorithm,Self-stabilization,Fault tolerance,Resource allocation,Shared resource,Mutual exclusion,Security token,Distributed computing | Conference |
Volume | Issue | ISSN |
15 | 11-12 | 0302-9743 |
ISBN | Citations | PageRank |
3-540-44049-6 | 2 | 0.42 |
References | Authors | |
12 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ajoy Kumar Datta | 1 | 317 | 40.76 |
| Rachid Hadid | 2 | 31 | 4.93 |
| Vincent Villain | 3 | 544 | 45.77 |