Sciweavers

2 search results - page 1 / 1
» Fast Randomized Test-and-Set and Renaming
Sort
View
WDAG
2010
Springer
168views Algorithms» more  WDAG 2010»
14 years 8 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...
CORR
2010
Springer
140views Education» more  CORR 2010»
14 years 10 months ago
Window-Based Greedy Contention Management for Transactional Memory
r of Abstraction (invited lecture) . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Barbara Liskov Fast Asynchronous Consensus with Optimal Resilience. . . . . . . . . . . ....
Gokarna Sharma, Brett Estrade, Costas Busch