Formal derivation of an algorithm for distributed phase synchronization

D.S. Buhaceanu, W.H.J. Feijen

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

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.
Original languageEnglish
Pages (from-to)207-213
JournalInformation Processing Letters
Volume60
Issue number4
DOIs
Publication statusPublished - 1996

Fingerprint

Dive into the research topics of 'Formal derivation of an algorithm for distributed phase synchronization'. Together they form a unique fingerprint.

Cite this