Sciweavers

WDAG
2010
Springer
164views Algorithms» more  WDAG 2010»
13 years 4 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
191views Algorithms» more  WDAG 2010»
13 years 4 months ago
Exclusive Perpetual Ring Exploration without Chirality
In this paper, we study the exclusive perpetual exploration problem with mobile anonymous and oblivious robots in a discrete space. Our results hold for the most generic settings:...
Lélia Blin, Alessia Milani, Maria Potop-But...
WDAG
2010
Springer
216views Algorithms» more  WDAG 2010»
13 years 4 months ago
A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware
The imminent arrival of best-effort transactional hardware has spurred new interest in the construction of nonblocking data structures, such as those that require atomic updates to...
Francois Carouge, Michael F. Spear
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 4 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
WDAG
2010
Springer
182views Algorithms» more  WDAG 2010»
13 years 4 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...
WDAG
2010
Springer
196views Algorithms» more  WDAG 2010»
13 years 4 months ago
Brief Announcement: Failure Detectors Encapsulate Fairness
Abstract. We argue that failure detectors encapsulate fairness. Fairness is a measure of the number of steps a process takes relative to another processes and/or messages in transi...
Scott M. Pike, Srikanth Sastry, Jennifer L. Welch
WDAG
2010
Springer
177views Algorithms» more  WDAG 2010»
13 years 4 months ago
Transactions as the Foundation of a Memory Consistency Model
We argue that traditional synchronization objects, such as locks, conditions, and atomic/volatile variables, should be defined in terms of transactions, rather than the other way ...
Luke Dalessandro, Michael L. Scott, Michael F. Spe...
WDAG
2010
Springer
184views Algorithms» more  WDAG 2010»
13 years 4 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
168views Algorithms» more  WDAG 2010»
13 years 4 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
218views Algorithms» more  WDAG 2010»
13 years 4 months ago
Anonymous Asynchronous Systems: The Case of Failure Detectors
Abstract: Due the multiplicity of loci of control, a main issue distributed systems have to cope with lies in the uncertainty on the system state created by the adversaries that ar...
François Bonnet, Michel Raynal