Efficient Distributed Detection of Conjunctions of Local Predicates - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 1995

Efficient Distributed Detection of Conjunctions of Local Predicates

Résumé

Global predicate detection is a fundamental problem in distributed systems and finds applications in many domains such as testing and debugging distributed programs. This paper presents two efficient distributed algorithms to detect conjunctive form global predicates in distributed systems. The algorithms detect the first consistent global state that satisfies the predicate even if the predicate is unstable. The algorithms are based on complementary approaches and are dual of each other. The algorithms are distributed because the predicate detection efforts as well as the necessary information is equally distributed among the processes. We prove the correctness of the algorithms and compare their performance with those of the existing predicate detection algorithms. The proposed algorithms compare very favorably with the existing algorithms in terms of the number of messages exchanged for predicate detection.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-2731.pdf (360.54 Ko) Télécharger le fichier

Dates et versions

inria-00073963 , version 1 (24-05-2006)

Identifiants

  • HAL Id : inria-00073963 , version 1

Citer

Michel Hurfin, Masaaki Mizuno, Michel Raynal, Mukesh Singhal. Efficient Distributed Detection of Conjunctions of Local Predicates. [Research Report] RR-2731, INRIA. 1995. ⟨inria-00073963⟩
90 Consultations
178 Téléchargements

Partager

Gmail Facebook X LinkedIn More