Abstract
A stepwise refinement method for the design of correct distributed algorithms is studied. The method frees the program designer from all the details of the target architecture of the system in early stages of the design process. The method is applied to a new aspect in the construction of distributed systems, the removal of virtual channels. We exemplify the design method by deriving a distributed algorithm. We show that the performed refinements preserve the correctness of the algorithm.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, Data Structures and Algorithms, Addison-Wesley, 1983.
R.J.R. Back and R. Kurki-Suonio, Decentralization of Process Nets with Centralized Control, Proc. of the Second ACM Symposium on PoDC, 1983, pp.131–142.
R.J.R. Back and R. Kurki-Suonio, A Case Study in Constructing Distributed Algorithms: Distributed Exchange Sort, Proc. of the Finnish Winter School on Theoretical Computer Science, 1984, pp. 1–33.
R.J.R. Back and R. Kurki-Suonio, Serializability in Distributed Systems with Handshaking, Technical Report, CMU-CS-85-109, 1985.
M. Chandy, Concurrent Programming for the Masses, Proc. of the 4th ACM Symposium on PoDC, 1985, pp. 1–12.
Mani Chandy and Jayadev Misra, An Example of Stepwise Refinement of Distributed Programs: Quiescence Detection, ACM TOPLAS, Vol. 8, No 3, July 1986, pp. 362–343.
K.M. Chandy and J. Misra, Systolic algorithms as programs, Distributed Computing, Vol. 1, No 3, 1986, Springer-Verlag, pp. 177–183.
E.W. Dijkstra, Guarded commands, nondeterminacy, and formal derivation of programs, Comm. ACM, Vol. 18, No 8, Aug. 1975, pp. 453–457.
David Gries, The Science of Programming, Springer-Verlag, 1981.
C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall International, 1985.
INMOS Ltd., occam Programming Manual, Prentice-Hall International, 1984.
N.C. Kalra and P.C.P. Bhatt, Parallel algorithms for tree traversals, Parallel Computing, Vol. 2, Number 2, June 1985, North Holland, pp. 163–171.
D.E. Knuth, The Art of Computer Programming, Vol. 1: Fundamental Algorithms, Addisson-Wesley, 1968.
Leslie Lamport, On interprocess communication, Part I and Part II, Distributed Computing, Vol. 1, No 2, 1986, Springer-Verlag, pp. 77–101.
A. Pnueli, Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends, LNCS 224, Springer-Verlag, 1986, pp. 510–584.
Kaisa Sere, Stepwise Removal of Virtual Channels in Distributed Algorithms: A Case Study, Åbo Akademi, Reports on computer science and mathematics, Ser. A, No 53, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sere, K. (1988). Stepwise removal of virtual channels in distributed algorithms. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019819
Download citation
DOI: https://doi.org/10.1007/BFb0019819
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