6343 search results - page 21 / 1269 » Robust consensus computation |
AINA
2010
IEEE
15 years 3 months ago
2010
IEEE
: This paper is on failure detectors to solve the consensus problem in asynchronous systems made up of anonymous processes prone to crash and connected by asynchronous reliable cha...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
JPDC
2008
14 years 10 months ago
2008
This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all...
PODC
2011
ACM
14 years 22 days ago
2011
ACM
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
System builders are becoming increasingly interested in robust design. We believe that a methodology for generating robustness metrics will help the robust design research efforts...