2924 search results - page 449 / 585 » Lower Bounds in Distributed Computing |
134
click to vote
PODC
2004
ACM
15 years 10 months ago
2004
ACM
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
142
Voted
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
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...
137
Voted
IDC
2009
Springer
15 years 11 months ago
2009
Springer
Scheduling meetings among agents can be represented as a game - the Meetings Scheduling Game (MSG). In its simplest form, the two-person MSG is shown to have a price of anarchy (Po...
145
click to vote
ICDCS
2007
IEEE
15 years 11 months ago
2007
IEEE
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
154
Voted
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
A Reconfigurable Consistency Algorithm (RCA) is an algorithm that guarantees the consistency in Distributed Shared Memory (DSM) Systems. In a RCA, there is a Configuration Control...