Abstract
We define a notion of genericity well-suited for networks of processes specified in Hoare's language CSP. Genericity expresses that processes have initially no knowledge of the network they are embedded in. We consider the problem of a fixed originator broadcasting a data through a given network. We show that the existence of generic (and/or symmetric) solutions to this problem depends crucially on the network's connectivity and on the use of I/O communication guards in CSP processes. This leads to a precise evaluation of the expressive power of guards in CSP. In particular, dynamic network exploration is possible if I/O guards are allowed. The algorithms described in this paper are built by systematic derivations from the so-called wave paradigm.
(extended abstract).
UUCP: ...!mcvax!inria!ens!bouge
This work is partially supported by the CNRS PRC C 3.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin, Local and global properties in networks of processes, Proc. 12th Ann. ACM Symp. Theory Comp., Los Angeles, Calif. (1980) 82–93.
K.R. Apt, N. Francez, Modelling the distributed termination convention of CSP, ACM Trans. Prog. Lang. Syst. 6, 3 (1984) 370–379.
K. Apt, J.-L. Richier, Real time clocks versus virtual clocks, Rept. No. 84-34, LITP, Univ. Paris 7, Paris (1984), to appear in ACM Trans. Prog. Lang. and Syst.
L. Bouge', Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP, Special issue on ICALP'85, Theor. Comp. Science 49 (1987) 145–169.
L. Bougé, Symmetry and genericity for CSP distributed systems, Rept. No. 85-32, LITP, Univ. Paris 7, Paris (May 1985). Submitted to Distributed Computing.
L. Bougé, On the existence of symmetric algorithms to find leaders in networks of Communicating Sequential Processes, Rept. No. 86-18, LITP, Univ. Paris 7, Paris (1986). To appear in Acta Informatica.
L. Bougé, Genericity and symmetry for distributed systems; the case of CSP, thèse d'état, Rept. No. 87/1, LIENS, Paris (March 1987). In French.
G.N. Buckley, A. Silberschatz, An effective implementation of the generalized input-output construct of CSP, ACM Trans. Prog. Lang. Syst. 5, 2 (1983) 223–235.
E.W. Dijkstra, W.H.J. Feijen, A.J.M. van Gasteren, Derivation of a termination detection algorithm for distributed computations, Inf. Proc. Letters 16 (1983) 217–219.
E.W.G. Dijkstra, C.S. Scholten, Termination detection for diffusing computations, Inf. Proc. Letters 11 (1980) 1–4.
S. Even, Graph algorithms (Computer Science Press, 1979).
N. Francez, Distributed termination, ACM Trans. Prog. Lang. Syst. 2 (1980) 42–55.
S.G. Finn, Resynch procedures and a fail-safe network protocol, IEEE Trans. Comm. COM-27, 6 (1979) 840–845.
M.G. Gouda, Distributed state exploration for protocol validation, Report No. 185, Dept. Computer Science, Univ. Texas, Austin, Texas (1981).
C.A.R. Hoare, Communicating sequential processes, Comm. ACM 21 (1978) 666–677.
Inmos Ltd., Occam programming manual (Prentice-Hall, 1984).
G. Jones, On guards, Proc. 7th Occam User Group Meeting and Workshop on Parallel Programming of Transputer based Machines (T. Muntean, ed.), Grenoble, France (Sept. 1987).
E. Korach, S. Moran, S. Zaks, Tight lower bounds and upper bounds to some distributed algorithms for a complete network of processors; Proc. 3rd Ann. ACM Symp. on Distr. Comp., Vancouver, B.C., Canada (Aug. 1984) 199–207.
G. Plotkin, An operational semantics for CSP, in: D. Bjorner, ed., Formal Description of Programming Concepts, IFIP TC-2 Working Conference, Garmish-Partenkirchen, Germany, 1982, (North-Holland, 1983) 199–223.
J.-M. Helary, C. Jard, N. Plouzeau, M. Raynal, La détection de propriétés stables pour les applications distribuées, Rept. No. 342, IRISA, Rennes, France (Jan. 1987).
J.-L. Richier, Distributed termination in CSP — symmetric solutions with minimal storage, Rept. No. 84-49, LITP, Univ. Paris 7, Paris (1984).
A. Segall, Distributed network protocols, IEEE Trans. Inf. Theory IT-29, 1 (1983) 23–35.
N. Shavit, N. Francez, Efficient detection of locally-indicative stable properties, Proc. Int. Coll. Automata, Languages and Prog., Rennes, 1986, Lect. Notes Comp. Science 194 (Springer, 1986).
R.B. Tan, J. van Leeuwen, General symmetric distributed termination detection, Rept. No. RUU-CS-86-2, Dept. Comp. Science, Rijksuniversitet, Utrecht, Pays-Bas (1986).
D.D. Wright, F.B. Schneider, A distributed path algorithm and its correctness proof, Rept. No. TR 83-556, Dept. of Computer Science, Cornell Univ., Ithaca, New York (1983).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bougé, L. (1988). On the existence of generic broadcast algorithms in networks of Communicating Sequential Processes. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019818
Download citation
DOI: https://doi.org/10.1007/BFb0019818
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19366-1
Online ISBN: 978-3-540-39239-2
eBook Packages: Springer Book Archive