Asynchronous interactions on shared data

Authors:
William W. Collier
Affiliations:
International Business Machines Corporation, Poughkeepsie, N. Y.
Venue:
ACM SIGOPS Operating Systems Review
Year:
1973

Citing 4
Cited 0

Further comments on Dijkstra's concurrent programming control problem

Communications of the ACM
Additional comments on a problem in concurrent programming control

Communications of the ACM
Additional comments on a problem in concurrent programming control

Communications of the ACM
Solution of a problem in concurrent programming control

Communications of the ACM

Quantified Score

Hi-index	0.01

Visualization

Abstract

In order to write algorithms which interact successfully on shared data, it is necessary to understand the assumptions which are made about each operation and to know whether or not the assumptions are met by the underlying hardware. There are several basic types of operations on shared data; from the number of these operations a measure of the degree of interaction between algorithms can be obtained. This measure can then be used to ensure that all instances of interaction are tested.