Abstract
The paper tackles the power of randomization in the context of local distributed computing by analyzing the ability to “boost” the success probability of deciding a distributed language using a Monte-Carlo algorithm. We prove that, in many cases, the ability to increase the success probability for deciding distributed languages is rather limited. This contrasts with the sequential computing setting where boosting can systematically be achieved by repeating the randomized execution.
Original language | English |
---|---|
Pages (from-to) | 419-434 |
Number of pages | 16 |
Journal | Distributed Computing |
Volume | 27 |
Issue number | 6 |
DOIs | |
Publication status | Published - 23 Nov 2014 |
Funding
Publisher Copyright: © 2014, Springer-Verlag Berlin Heidelberg.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Computational Theory and Mathematics