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...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters 1998-05, Vol.66 (4), p.175-180
Main Authors: Feuerstein, Esteban, Leonardi, Stefano, Marchetti-Spaccamela, Alberto, Santoro, Nicola
Format: Article
Language:English
Subjects:
Amortized analysis
Applied sciences
Computer networks
Computer programming
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Distributed computing
Distributed processing
Exact sciences and technology
Protocol
Software
Studies
Token ring
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(98)00054-4