Efficient token-based control in rings
In this paper we deal with the efficiency of token-based strategies for the basic problem of controlling the allocation of a shared resource in a ring of n processing entities. We propose new protocols that allow a bounded number of exchanged messages per access request to the resource, while this a...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_00200190_v66_n4_p175_Feuerstein |
| Aporte de: |
| Sumario: | In this paper we deal with the efficiency of token-based strategies for the basic problem of controlling the allocation of a shared resource in a ring of n processing entities. We propose new protocols that allow a bounded number of exchanged messages per access request to the resource, while this amount is unbounded for classical solutions. We also guarantee all the requests to be served within a maximum delay. The new proposed protocols are request-message-based strategies, in that a process entity sends a message to "inform" the token of the access request. © 1998 Elsevier Science B.V. All rights reserved. |
|---|