Sciweavers

20 search results - page 3 / 4
» wdag 2010
Sort
View
WDAG
2010
Springer
204views Algorithms» more  WDAG 2010»
13 years 6 months ago
The Cost of Privatization
Software transactional memory (STM) guarantees that a transaction, consisting of a sequence of operations on the memory, appears to be executed atomically. In practice, it is impor...
Hagit Attiya, Eshcar Hillel
WDAG
2010
Springer
168views Algorithms» more  WDAG 2010»
13 years 6 months ago
Fast Randomized Test-and-Set and Renaming
Most people believe that renaming is easy: simply choose a name at random; if more than one process selects the same name, then try again. We highlight the issues that occur when t...
Dan Alistarh, Hagit Attiya, Seth Gilbert, Andrei G...
WDAG
2010
Springer
184views Algorithms» more  WDAG 2010»
13 years 6 months ago
Fast Asynchronous Consensus with Optimal Resilience
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
Ittai Abraham, Marcos Kawazoe Aguilera, Dahlia Mal...
WDAG
2010
Springer
164views Algorithms» more  WDAG 2010»
13 years 5 months ago
It's on Me! The Benefit of Altruism in BAR Environments
Abstract. Cooperation, a necessity for any peer-to-peer (P2P) cooperative service, is often achieved by rewarding good behavior now with the promise of future benefits. However, in...
Edmund L. Wong, Joshua B. Leners, Lorenzo Alvisi
WDAG
2010
Springer
182views Algorithms» more  WDAG 2010»
13 years 6 months ago
Scalable Flat-Combining Based Synchronous Queues
In a synchronous queue, producers and consumers handshake to exchange data. Recently, new scalable unfair synchronous queues were added to the Java JDK 6.0 to support high performa...
Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafr...