Sciweavers

313 search results - page 4 / 63
» Computing synchronizer failure probabilities
Sort
View
85
Voted
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
15 years 6 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...
PODC
2009
ACM
15 years 4 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
PODC
2011
ACM
14 years 2 months ago
Robust network supercomputing without centralized control
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
Seda Davtyan, Kishori M. Konwar, Alexander A. Shva...
IPPS
2000
IEEE
15 years 4 months ago
A Mechanism for Speculative Memory Accesses Following Synchronizing Operations
In order to reduce the overhead of synchronizing operations of shared memory multiprocessors, this paper proposes a mechanism, named specMEM, to execute memory accesses following ...
Takayuki Sato, Kazuhiko Ohno, Hiroshi Nakashima
104
Voted
ICPPW
2009
IEEE
15 years 6 months ago
Decentralized Load Balancing for Improving Reliability in Heterogeneous Distributed Systems
Abstract—A probabilistic analytical framework for decentralized load balancing (LB) strategies for heterogeneous distributed-computing systems (DCSs) is presented with the overal...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat