Probabilistic Non-asymptotic Analysis of Distributed Algorithms

Abstract

We present a new probabilistic analysis of distributed algorithms. Our approach relies on the theory of quasi-stationary distributions (QSD) recently developped by Champagnat and Villemonais. We give properties on the deadlock time and the distribution of the model before deadlock, both for discrete and diffusion models. Our results are non-asymptotic since they apply to any finite values of the involved parameters (time, numbers of resources, number of processors, etc.) and reflect the real behavior of these algorithms, with potential applications to deadlock prevention, which are very important for real world applications in computer science.