|
ABSTRACT
A new method for expressing synchronization is presented which derives from several concepts in existing notational schemes. Synchronization conditions are expressed in terms of (integer) counters which are incorporated into the definitions of data objects shared by several asynchronous processes. It is shown that the method is at least as powerful as PV-type synchronization, and the solutions to some "classical" problems are presented using the notation.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Brinch Hansen, P. : A Comparison of Two Synchronizing Concepts, Acta Informatica <u>1</u>, 190--199 (1972).
|
| |
2
|
|
| |
3
|
Campbell, R. H. : Path Expressions, Ph.D Thesis, University of Newcastle Upon Tyne, August 1976.
|
 |
4
|
|
 |
5
|
|
| |
6
|
Courtois, P. J., Heymans, F. & Parnas, D. L. : Comments on "A Comparison of Two Synchronizing Concepts", Acta Informatica <<u>1</u>, 375--376 (1972).
|
| |
7
|
Dijkstra, E. W. : Hierarchical Ordering of Sequential Processes, Acta Informatica, <u>1</u>, 115--138 (1971).
|
| |
8
|
|
| |
9
|
Habermann, A. N. : Path Expressions, Carnegie-Mellon University, June 1975.
|
 |
10
|
|
| |
11
|
Hoare, C. A. R. : Communicating Sequential Processes (draft), Queen's University of Belfast, August 1976.
|
| |
12
|
Lauer, P. E. & Campbell, R. H. : Formal Semantics of a Class of High-Level Primitives for Co-ordinating Concurrent Processes, Acta Informatica, <u>5</u>, 297--332 (1975).
|
 |
13
|
|
| |
14
|
Patil, S. S. : Limitations and Capabilities of Dijkstra's Semaphore Primitives for Co-ordination amongst Processes, Project MAC, Computational Structures Group Memo 57, February, 1971.
|
| |
15
|
|
| |
16
|
Wirth, N.: MODULA: A Language for Modular Multiprogramming, ETH Institut fur Informatik Report No. 18, March 1976.
|
|