Sciweavers

7 search results - page 1 / 2
» Convergence Verification: From Shared Memory to Partially Sy...
Sort
View
FORMATS
2008
Springer
13 years 6 months ago
Convergence Verification: From Shared Memory to Partially Synchronous Systems
Verification of partially synchronous distributed systems is difficult because of inherent concurrency and the potentially large state space of the channels. This paper identifies ...
K. Mani Chandy, Sayan Mitra, Concetta Pilotto
PODC
2009
ACM
13 years 9 months ago
The weakest failure detector for solving k-set agreement
A failure detector is a distributed oracle that provides processes in a distributed system with hints about failures. The notion of a weakest failure detector captures the exact a...
Eli Gafni, Petr Kuznetsov
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
13 years 11 months ago
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
PADS
2003
ACM
13 years 9 months ago
Parallel Network Simulation under Distributed Genesis
We describe two major developments in the General Network Simulation Integration System (Genesis): the support for BGP protocol in large network simulations and distribution of th...
Boleslaw K. Szymanski, Yu Liu, Rashim Gupta
POPL
2009
ACM
14 years 5 months ago
Feedback-directed barrier optimization in a strongly isolated STM
Speed improvements in today's processors have largely been delivered in the form of multiple cores, increasing the importance of ions that ease parallel programming. Software...
Nathan Grasso Bronson, Christos Kozyrakis, Kunle O...