Sciweavers

37 search results - page 2 / 8
» Bounds for Mutual Exclusion with only Processor Consistency
Sort
View
IPPS
1997
IEEE
13 years 10 months ago
Empirical Evaluation of Distributed Mutual Exclusion Algorithms
In this paper, we evaluated various distributed mutual exclusion algorithms on the IBM SP2 machine and the Intel iPSC/860 system. The empirical results are compared in terms of su...
Shiwa S. Fu, Nian-Feng Tzeng, Zhiyuan Li
IPL
2000
115views more  IPL 2000»
13 years 5 months ago
Randomized uniform self-stabilizing mutual exclusion
Abstract. The mutual exclusion protocol presented ensures that whatever perturbation the network undergo, it regains consistency in nite time: one and only one privilege token is p...
Jérôme Olivier Durand-Lose
IPPS
2009
IEEE
14 years 12 days ago
The Weak Mutual Exclusion problem
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...
Paolo Romano, Luís Rodrigues, Nuno Carvalho
ACTA
2011
13 years 20 days ago
Nonatomic dual bakery algorithm with bounded tokens
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the shared variables behave...
Alex A. Aravind, Wim H. Hesselink
ECCV
2010
Springer
13 years 11 months ago
Detecting People Using Mutually Consistent Poselet Activations
Bourdev and Malik (ICCV 09) introduced a new notion of parts, poselets, constructed to be tightly clustered both in the configuration space of keypoints, as well as in the appeara...