13752 search results - page 2219 / 2751 » Parallel and Distributed Haskells |
239
click to vote
ICDCN
2011
Springer
14 years 10 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
244
click to vote
ICS
2011
Tsinghua U.
14 years 10 months ago
2011
Tsinghua U.
The probability that a failure will occur before the end of the computation increases as the number of processors used in a high performance computing application increases. For l...
209
click to vote
PODC
2011
ACM
14 years 10 months 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...
215
click to vote
PODC
2011
ACM
14 years 10 months ago
2011
ACM
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...
245
click to vote
PODC
2011
ACM
14 years 10 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...