Abstract
Methodological design of distributed programs is of major concern to master parallelism. Due to their role in distributed systems, the class of observation or detection programs, whose aim is to observe or detect properties of an observed program, is very important. The detection of a property generally rests upon consistent evaluations of a predicate; such a predicate can be global, i.e. involve states of several processes and channels of the observed program. Unfortunately, in a distributed system, the consistency of an evaluation cannot be trivially obtained. This is a central problem in distributed evaluations. This paper addresses the problem of distributed evaluation, as a basic tool for the design of a general distributed detection program.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work was supported by French Research Program C3 on Parallelism and Distributed Computing
This article was processed using the LATEX macro package with LLNCS style
Preview
Unable to display preview. Download preview PDF.
References
L. Bougé and N. Francez. A Compositional Approach to Superimposition. in Proc. ACM Symposium on POPL, San Diego, 1988.
K.M. Chandy and L. Lamport. Distributed Snapshots: Determining Global States of Distributed Systems. ACM TOCS, 3(1):63–75, Feb. 1985.
K.M. Chandy and J. Misra. Parallel Program Design: a Foundation. Addison Wesley, 1988.
E.W. Dijkstra and C.S. Scholten. Termination Detection for Diffusing Computations. Inf. Proccessing Letters, Vol. 11:1–4, 1980.
N. Francez. Distributed Termination. ACM Toplas, 2-1, 1980.
J.M. Hélary. Observing Global States of Asynchronous Distributed Computations. in Proc. 3rd Int. Workshop on Distributed Algorithms, Nice, sept. 1989. Springer-Verlag LNCS 392:124–135.
J. M Hélary, C. Jard, N. Plouzeau, and M. Raynal. Detection of Stable Properties in Distributed Applications. in Proc. 6th annual ACM Symposium on Principles of Distributed Computing, pages 125–136, Vancouver, August 1987.
J. M. Hélary, M. Raynal. Control and Synchronisation of Distributed Systems and Programs. Wiley Series in Parallel Computing, August 1990.
J. M. Hélary, M. Raynal. Towards the Construction of Distributed Detection Programs, with an Application to Distributed Termination. Res. Rep. IRISA, University of Rennes 1, june 1991.
F. Mattern. Algorithms for Distributed Termination Detection. Distributed Computing, 2:161–175, 1987.
J. Misra. Detecting Termination of Distributed Computation Using Markers. in Proc. 2d ACM Symp. on PODC, Montreal, 1983, pp 290–294.
F.P. Schneider. Paradigms for Distributed Programs. In Distributed Systems, LNCS 190: 431–480, Springer-Verlag Ed., 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hélary, JM., Raynal, M. (1992). Distributed evaluation: a tool for constructing distributed detection programs. In: Dolev, D., Galil, Z., Rodeh, M. (eds) Theory of Computing and Systems. ISTCS 1992. Lecture Notes in Computer Science, vol 601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035177
Download citation
DOI: https://doi.org/10.1007/BFb0035177
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55553-7
Online ISBN: 978-3-540-47214-8
eBook Packages: Springer Book Archive