Proving time bounds for randomized distributed algorithms
组合数学
2016-09-06 v1 计算复杂性
摘要
A method of analyzing time bounds for randomized distributed algorithms is presented, in the context of a new and general framework for describing and reasoning about randomized algorithms. The method consists of proving auxiliary statements of the form U (t)->(p) U', which means that whenever the algorithm begins in a state in set U, with probability p, it will reach a state in set U' within time t. The power of the method is illustrated by its use in proving a constant upper bound on the expected time for some process to reach its critical region, in Lehmann and Rabin's Dining Philosophers algorithm.
引用
@article{arxiv.math/9409221,
title = {Proving time bounds for randomized distributed algorithms},
author = {Nancy Lynch and Isaac Saias and Roberto Segala},
journal= {arXiv preprint arXiv:math/9409221},
year = {2016}
}
备注
19 pages