Probabilistic analysis of some distributed algorithms
Résumé
In this paper, we analyze : a storage allocation algorithm which permits to maintain two stacks inside a shared (contiguous) memory area of a fixed size - the well-known banker algorithm which plays a fundamental role in parallel processing. The natural formulation of these problems is in terms of constrained random walks. Our results rely on diffusion techniques.