| Abstract: | In a network of processors, a distributed operating system must handle the management of shared resources. In this paper, it is shown how to solve this problem in using the model previously introduced in 1]. This model (interconnection of N Markov chains each representing locally a distributed process) allows us to prove the good functioning properties for some distributed problems such as the mutual exclusion problem and the deadlock problem, We also prove that fairness is a basic notion for setting the model’s parameters and obtain an optimal working of the network. |
