Parallel Programs with Synchronization
For many applications we need parallel programs whose components can synchronize with each other, in that they wait or get blocked until the execution of the other components changes the shared variables into a more favourable state. We therefore extend now (in Section 7.1) the program syntax by a synchronization construct, the await-statement introduced in Owicki and Gries [OG76a].
KeywordsParallel Program Mutual Exclusion Component Program Total Correctness Atomic Region
Unable to display preview. Download preview PDF.
- [Dij68]E.W. Dijkstra. Cooperating sequential processes. In F. Genuys, editor, Programming Languages: NATO Advanced Study Institute, pages 43–112, London, 1968. Academic Press.Google Scholar
- [Hoa72]C.A.R. Hoare. Towards a theory of parallel programming In C.A.R. Hoare and R.H. Perrot, editors, Operating Systems Techniques,pages 61–71. Academic Press, 1972.Google Scholar
- [MP81]Z. Manna and A. Pnueli. Verification of concurrent programs: the temporal framework. In R.S. Boyer and J.S. Moore, editors, The Correctness Problem in Computer Science, International Lecture Series in Computer Science, London, 1981. Academic Press.Google Scholar
- [MP83]Z. Manna and A. Pnueli. How to cook a temporal proof system for your pet language. In Proceedings of the 10th Annual ACM Symposium on Principles of Programming Languages, pages 141154, Austin, Texas, U.S.A., 1983.Google Scholar
- [Ray86]M. Raynal. Algorithms for Mutual Exclusion. The MIT Press, Cambridge, Mass, 1986.Google Scholar
- [SA86]F.B. Schneider and G.R. Andrews. Concepts of concurrent programming. In J.W. de Bakker, W.P. de Roever, and G. Rozenberg, editors, Current Trends in Concurrency,pages 669–716, New York, 1986. Lecture Notes in Computer Science 224, Springer-Verlag.Google Scholar