306 search results - page 7 / 62 » Fault-Tolerant Computation in the Full Information Model |
WAOA
2007
Springer
14 years 1 months ago
2007
Springer
We consider the following distributed optimization problem: three agents i = 1, 2, 3 are each presented with a load drawn independently from the same known prior distribution. Then...
TAPIA
2009
ACM
14 years 11 days ago
2009
ACM
According to Computing Research Association, during each year between 2003 and 2007, fewer than 3% of the US’s Ph.D.s graduates in computer science and computer engineering were...
CLOUD
2010
ACM
14 years 24 days ago
2010
ACM
We present a parallel data processor centered around a programming model of so called Parallelization Contracts (PACTs) and the scalable parallel execution engine Nephele [18]. Th...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
ISCA
2011
IEEE
12 years 11 months ago
2011
IEEE
With technology scaling, manufacture-time and in-field permanent faults are becoming a fundamental problem. Multi-core architectures with spares can tolerate them by detecting an...