๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A distributed self-stabilizing solution to the dining philosophers problem

โœ Scribed by Debra Hoover; Joseph Poole

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
503 KB
Volume
41
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A self-stabilizing algorithm for the sho
A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
โœ Tetz C. Huang ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1015 KB

Shortest path finding has a variety of applications in transportation and communication. In this paper, we study a well-known self-stabilizing algorithm for the shortest path problem for the distributed systems. The prevlotm works on this topic had two assumptions that can be relaxed in this paper.

A Self-Stabilizing Distributed Algorithm
A Self-Stabilizing Distributed Algorithm to Find the Median of a Tree Graph
โœ Gheorghe Antonoiu; Pradip K. Srimani ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 231 KB

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.