Sciweavers

339 search results - page 2 / 68
» Performance of Fair Distributed Mutual Exclusion Algorithms
Sort
View
ISSADS
2005
Springer
13 years 10 months ago
Implementing Distributed Mutual Exclusion on Multithreaded Environments: The Alien-Threads Approach
We present a simple implementation of a token-based distributed mutual exclusion algorithm for multithreaded systems. Several per-node requests could be issued by threads running ...
Federico Meza, Jorge Pérez R., Yadran Etero...
DC
2010
13 years 6 days ago
Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
Robert Danek, Wojciech M. Golab
EUROPAR
2008
Springer
13 years 7 months ago
The Impact of Clustering on Token-Based Mutual Exclusion Algorithms
We present in this article a theoretical study and performance results about the impact of the Grid architecture on token-based mutual exclusion algorithms. To this end, both the o...
Julien Sopena, Luciana Arantes, Fabrice Legond-Aub...
IPPS
1998
IEEE
13 years 9 months ago
Prioritized Token-Based Mutual Exclusion for Distributed Systems
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment...
Frank Mueller
EUROPAR
2006
Springer
13 years 9 months ago
A Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
Hyungsoo Jung, Heon Young Yeom