Name
Abstract | ||
|---|---|---|
A token-based distributed algorithm to perform the allocation of any one from a set of multiple instances of a shared resource type has been presented in this note. The number of messages generated by the algorithm per critical section execution for accessing a resource instance varies from 0 to 2( n − 1), where n is the number of nodes in the distributed system. An advantage of the algorithm presented here is that the upper bound on the number of messages generated per critical section execution is independent of the number of instances of the resource type covered by the algorithm. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1006/jpdc.1994.1122 | J. Parallel Distrib. Comput. |
Keywords | Field | DocType |
multiple instance resource allocation,resource allocation | Data structure,Suzuki-Kasami algorithm,Shared memory,Computer science,Critical section,Resource allocation,Distributed algorithm,Shared resource,Security token,Distributed computing | Journal |
Volume | Issue | ISSN |
23 | 1 | Journal of Parallel and Distributed Computing |
Citations | PageRank | References |
2 | 0.37 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. Satyanarayanan | 1 | 5 | 1.08 |
| C. R. Muthukrishnan | 2 | 28 | 13.90 |