Formal derivation of an algorithm for distributed phase synchronization
✍ Scribed by D.S. Buhăceanu; W.H.J. Feijen
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 620 KB
- Volume
- 60
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
✦ Synopsis
The main purpose of this paper is to create more evidence for the observation that parallel programs, distributed or not, can be formally -and economically -derived by means of just the predicate calculus and the theory of Owicki and Gries. The example selected here is the problem of phase synchronization, in which a number of programs each pass through an unlimited number of phases in a more or less synchronous fashion. A solution is developed for the special case of programs located in the nodes of a tree with communication facilities restricted to communication with neighbouring nodes.
📜 SIMILAR VOLUMES
A method of determining the most effective way to joint lines in an optical distribution network is needed, because of the high cost of jointing optical-fiber lines compared to lines in a metallic network and because of the limitation on the number of joints. In this paper, I model the joint form pl