Probabilistic analysis of some distributed algorithms

DOI10.1002/rsa.3240020203zbMath0732.68055OpenAlexW2093891645MaRDI QIDQ3358236

René Schott, Guy Louchard

Publication date: 1991

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00075319/file/RR-1239.pdf

zbMATH Keywords

random walksstorage allocation algorithmbanker algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Related Items (11)

Random walks, heat equation and distributed algorithms ⋮ Large deviations analysis for distributed algorithms in an ergodic Markovian environment ⋮ Probabilistic analysis of some (un)directed animals ⋮ The exhaustion of shared memory: Stochastic results ⋮ Approximation of excessive backlog probabilities of two tandem queues ⋮ Excessive backlog probabilities of two parallel queues ⋮ Hitting time of a corner for a reflected diffusion in the square ⋮ The shape of stretched planar trees ⋮ Analysis of distributed systems via quasi-stationary distributions ⋮ Asymptotic properties of some underdiagonal walks generation algorithms ⋮ Approximation of the exit probability of a stable Markov modulated constrained random walk

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Brownian motion and algorithm complexity
• Random walks, Gaussian processes and list structures
• An accurate algorithm for computing the eigenvalues of a polygonal membrane
• Recurrence times and capacities for finite ergodic chains
• Dénombrements de chemins dans $\mathbb {R}^2$ soumis à contraintes
• Perturbation bounds for the stationary probabilities of a finite Markov chain
• Representation Theory for Denumerable Markov Chains

This page was built for publication: Probabilistic analysis of some distributed algorithms