Synthesis of Efficient Drinking Philosphers Algorithms
A variant of the drinking philosphers algorithm of Chandy and Misra is described and proved correct in a module way, using the I/O automaton model of Lynch and Tuttle. The algorithm of Chandy and Misra is based on an particular dining philosophers algorithm, and relies on certain properties of its i...
Main Authors: | Welch, Jennifer Lundelius, Lynch, Nancy A. |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149155 |
Similar Items
-
A Modular Drinking Philosophers Algorithm
by: Welch, Jennifer Lundelius, et al.
Published: (2023) -
A Lattice-structured Proof Technique Applied to a Minimum Spanning Tree Algorithm
by: Welch, Jennifer Lundelius, et al.
Published: (2023) -
A New Fault-tolerant Algorithm for Clock Sychronization
by: Lundelius, Jennifer, et al.
Published: (2023) -
Synchornizing Clocks in a Distributed System
by: Lundelius, Jennifer
Published: (2023) -
Topics in distributed computing : the impact of partial synchrony, and modular decomposition of algorithms
by: Welch, Jennifer
Published: (2013)