Robust network supercomputing with unreliable workers ?
We analyze a masterworker model of a distributed system, where workers may be unreliable. We propose two failure models in the above system and design algorithms for them. We provide complexity for work and number of messages delivered in the execution of the algorithm. We also provide a lower bound for work in one of the models.
distributed algorithms fault-tolerance randomized algorithms reliability internet supercomputing