Sciweavers

WDAG
2005
Springer
82views Algorithms» more  WDAG 2005»
14 years 5 months ago
Distributed Transactional Memory for Metric-Space Networks
Transactional Memory is a concurrent programming API in which concurrent threads synchronize via transactions (instead of locks). Although this model has mostly been studied in the...
Maurice Herlihy, Ye Sun
WDAG
2005
Springer
92views Algorithms» more  WDAG 2005»
14 years 5 months ago
Could any Graph be Turned into a Small-World?
Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebha...
WDAG
2005
Springer
67views Algorithms» more  WDAG 2005»
14 years 5 months ago
What Can Be Implemented Anonymously?
Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? W...
Rachid Guerraoui, Eric Ruppert
WDAG
2005
Springer
104views Algorithms» more  WDAG 2005»
14 years 5 months ago
Polymorphic Contention Management
Abstract. In software transactional memory (STM) systems, a contention manager resolves conflicts among transactions accessing the same memory locations. Whereas atomicity and ser...
Rachid Guerraoui, Maurice Herlihy, Bastian Pochon
WDAG
2005
Springer
157views Algorithms» more  WDAG 2005»
14 years 5 months ago
(Almost) All Objects Are Universal in Message Passing Systems
d Abstract) Carole Delporte-Gallet1 , Hugues Fauconnier2 , and Rachid Guerraoui3 1 ESIEE-IGM Marne-La-Vallee, France 2 LIAFA Univ Paris VII, France 3 EPFL Lausanne, Switzerland Thi...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
WDAG
2005
Springer
77views Algorithms» more  WDAG 2005»
14 years 5 months ago
Restricted Stack Implementations
We introduce a new object, BH, and prove that a system with one BH object and single-writer Registers has the same computational power as a system with countably many commutative a...
Matei David, Alex Brodsky, Faith Ellen Fich
WDAG
2005
Springer
118views Algorithms» more  WDAG 2005»
14 years 5 months ago
Distributed Computing with Imperfect Randomness
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanatha...
WDAG
2005
Springer
90views Algorithms» more  WDAG 2005»
14 years 5 months ago
Proving Atomicity: An Assertional Approach
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Jos...
WDAG
2005
Springer
85views Algorithms» more  WDAG 2005»
14 years 5 months ago
Time and Space Lower Bounds for Implementations Using k-CAS
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...
Hagit Attiya, Danny Hendler