Sciweavers

285 search results - page 36 / 57
» PODC: Paradigm-Oriented Distributed Computing
Sort
View
PODC
2011
ACM
14 years 1 months ago
The complexity of robust atomic storage
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
Dan Dobre, Rachid Guerraoui, Matthias Majuntke, Ne...
PODC
2012
ACM
13 years 1 months ago
Faster randomized consensus with an oblivious adversary
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that gu...
James Aspnes
99
Voted
PODC
2010
ACM
15 years 3 months ago
Constant RMR solutions to reader writer synchronization
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
Vibhor Bhatt, Prasad Jayanti
PODC
2009
ACM
15 years 11 months ago
Brief announcement: collaborative measurement of upload speeds in P2P systems
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
John R. Douceur, James W. Mickens, Thomas Moscibro...
PODC
2004
ACM
15 years 4 months ago
Load balancing and locality in range-queriable data structures
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing wit...
James Aspnes, Jonathan Kirsch, Arvind Krishnamurth...