𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Self-Stabilizing Distributed Algorithm to Find the Median of a Tree Graph

✍ Scribed by Gheorghe Antonoiu; Pradip K. Srimani

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
231 KB
Volume
58
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

✦ Synopsis

We propose a self-stabilizing algorithm (protocol) for computing the median in a given tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction.

πŸ“œ SIMILAR VOLUMES

A Self-Stabilizing Leader Election Algor
A Self-Stabilizing Leader Election Algorithm for Tree Graphs
✍ Gheorghe Antonoiu; Pradip K. Srimani πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 231 KB

We propose a self-stabilizing algorithm (protocol) for leader election in a tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction.

Algorithms to calculate the distribution
Algorithms to calculate the distribution of the longest path length of a stochastic activity network with continuous activity durations
✍ Lawrence M. Leemis; Matthew J. Duggan; John H. Drew; Jeffrey A. Mallozzi; Kerry πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 397 KB

## Abstract We develop algorithms to calculate the probability distribution of the longest path of an arbitrary stochastic activity network with continuous activity durations by three techniques: recursive Monte Carlo simulation, series‐parallel reduction, and conditioning. Examples illustrate the