Ciuffoletti, Augusto (2010) The wandering token: Congestion avoidance of a shared resource. Future Generation Computer Systems, 2010 (26). pp. 473-478. ISSN 0167-739X
This is the latest version of this item.
Download (154Kb) | Preview
In a distributed system where scalability is an issue, the problem of enforcing mutual exclusion often arises in a soft form: the infrequent failure of the mutual exclusion predicate is tolerated, without compromising the consistent operation of the overall system. For instance this occurs when the operation subject to mutual exclusion requires massive use of a shared resource. We introduce a scalable soft mutual exclusion algorithm, based on previous termtokennext term passing: one distinguished feature of our algorithm is that instead of introducing an overlay topology we adopt a random walk approach. The consistency of our proposal is evaluated by simulation, and we exemplify its use in the coordination of large data transfers in a backbone based network. This algorithm is studied in the frame of the CoreGRID Institute of Grid Information, Resource and Workflow Monitoring Services, in cooperation with the FORTH Institute, in Greece.
|Additional Information:||Presentation available at http://www.slideshare.net/AugustoCiuffoletti/the-wandering-token-2861360|
|Uncontrolled Keywords:||congestion avoidance, random walk, random graph, token circulation, self-stabilization, soft mutual exclusion|
|Subjects:||Area01 - Scienze matematiche e informatiche > INF/01 - Informatica|
|Divisions:||Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA|
|Depositing User:||Augusto Ciuffoletti|
|Date Deposited:||23 Jun 2010|
|Last Modified:||20 Dec 2010 11:45|
Available Versions of this Item
- The wandering token: Congestion avoidance of a shared resource. (deposited 31 Aug 2009)
- The wandering token: Congestion avoidance of a shared resource. (deposited 23 Jun 2010)[Currently Displayed]
Repository staff only actions