×

On optimal management of resources in distributed networks. (English) Zbl 0716.68039

The paper deals with the management of shared resources in the context of a network of processors. Examples are given concerning the mutual exclusion problem and the deadlock problem.
For the first problem four possible states of a process are introduced: request, refusal, acceptation and execution. Based on the transition matrix, the corresponding mean recurrence time for all the states are defined. Following, different optimality criteria are selected, e.g. the optimization of the number of “refusal” or the number of “acceptation“.
Regarding the deadlock problem, for each process are considered four possible states: active, idle, terminated and blocked. The analysis is conducted the same way as above. The fairness of the method is claimed.
Reviewer: D.Grigoras

MSC:

68W15 Distributed algorithms
68M10 Network design and communication in computer systems
Full Text: DOI

References:

[1] Bui, M, Réglage pour mi fonctíonnement optimal d’un réseau de processeurs en algorithmique distribuée. Research Report CERFACS TR 88-4, 1988, France. to appear in Revue R. de Math. Pures et Appl., No. 3, 1990
[2] Carton D, Processus aléatoires utilisés en Recherche Opérationnelle (1975)
[3] Chandy K.M, Parallel Program Design: A foundation (1988)
[4] DOI: 10.1145/357360.357365 · doi:10.1145/357360.357365
[5] DOI: 10.1007/BF00289519 · doi:10.1007/BF00289519
[6] Iosifescu M, Finite Markov processes and their applications (1980)
[7] DOI: 10.1145/359576.359585 · Zbl 0383.68028 · doi:10.1145/359576.359585
[8] DOI: 10.1145/5383.5385 · Zbl 0627.68018 · doi:10.1145/5383.5385
[9] Naimi M, TSI 6 pp 141– (1987)
[10] Raynal M, Algorithmique du parallélisme: Le problème de l’exclusion mutuelle (1984)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.