Fair mutual exclusion on a graph of processes |
| |
Authors: | Jan L. A. van de Snepscheut |
| |
Affiliation: | (1) Department of Mathematics and Computing Science, Groningen University, The Netherlands |
| |
Abstract: | We represent a set of communicating processes by a graph. The mutual exclusion problem is solved for an arbitrary connected graph. The solution is shown to be fair.Jan L.A. van de Snepscheut received a PhD from the Eindhoven University of Technology. He was a visiting assistant professor at the California Institute of Technology, and is presently a professor of computing science at Groningen University. |
| |
Keywords: | Mutual exclusion Communicating processes Fairness |
本文献已被 SpringerLink 等数据库收录! |