Sciweavers

231 search results - page 17 / 47
» Asynchronous failure detectors
Sort
View
ICDCS
1996
IEEE
14 years 23 days ago
How to Recover Efficiently and Asynchronously when Optimism Fails
We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts - a fault-tolerant vector clock t...
Om P. Damani, Vijay K. Garg
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
14 years 3 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
1999
ACM
14 years 27 days ago
On k-Set Consensus Problems in Asynchronous Systems
ÐIn this paper, we investigate the k-set consensus problem in asynchronous distributed systems. In this problem, each participating process begins the protocol with an input value...
Roberto De Prisco, Dahlia Malkhi, Michael K. Reite...
ICMCS
2008
IEEE
207views Multimedia» more  ICMCS 2008»
14 years 3 months ago
Analyzing video concept detectors visually
In this demonstration we showcase an interactive analysis tool for researchers working on concept-based video retrieval. By visualizing intermediate concept detection analysis sta...
Cees G. M. Snoek, Richard van Balen, Dennis Koelma...
OPODIS
2003
13 years 10 months ago
Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
Dariusz R. Kowalski, Mariam Momenzadeh, Alexander ...