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: |
| id |
todo:paper_00200190_v66_n4_p175_Feuerstein |
|---|---|
| record_format |
dspace |
| spelling |
todo:paper_00200190_v66_n4_p175_Feuerstein2023-10-03T14:16:42Z Efficient token-based control in rings Feuerstein, E. Leonardi, S. Marchetti-Spaccamela, A. Santoro, N. Amortized analysis Distributed computing 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. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_00200190_v66_n4_p175_Feuerstein |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| topic |
Amortized analysis Distributed computing |
| spellingShingle |
Amortized analysis Distributed computing Feuerstein, E. Leonardi, S. Marchetti-Spaccamela, A. Santoro, N. Efficient token-based control in rings |
| topic_facet |
Amortized analysis Distributed computing |
| description |
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. |
| format |
JOUR |
| author |
Feuerstein, E. Leonardi, S. Marchetti-Spaccamela, A. Santoro, N. |
| author_facet |
Feuerstein, E. Leonardi, S. Marchetti-Spaccamela, A. Santoro, N. |
| author_sort |
Feuerstein, E. |
| title |
Efficient token-based control in rings |
| title_short |
Efficient token-based control in rings |
| title_full |
Efficient token-based control in rings |
| title_fullStr |
Efficient token-based control in rings |
| title_full_unstemmed |
Efficient token-based control in rings |
| title_sort |
efficient token-based control in rings |
| url |
http://hdl.handle.net/20.500.12110/paper_00200190_v66_n4_p175_Feuerstein |
| work_keys_str_mv |
AT feuersteine efficienttokenbasedcontrolinrings AT leonardis efficienttokenbasedcontrolinrings AT marchettispaccamelaa efficienttokenbasedcontrolinrings AT santoron efficienttokenbasedcontrolinrings |
| _version_ |
1807315791920496640 |