Premium
The implementation of synchronizing operations in various environments
Author(s) -
Wettstein H.
Publication year - 1977
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380070107
Subject(s) - synchronizing , realization (probability) , interdependence , computer science , dijkstra's algorithm , distributed computing , theoretical computer science , shortest path problem , mathematics , telecommunications , sociology , social science , graph , statistics , transmission (telecommunications)
Abstract Since E. W. Dijkstra's work on the mutual interdependencies of co‐operating sequential processes there has been much discussion on various synchronizing mechanisms. This discussion usually leads to abstract definitions of synchronizing primitives. However, their realization proceeds differently in various environments. Length of critical regions, number of processors, and dispatching strategy have to be taken into account. In this paper is presented a family of synchronizing operations, the members of which are all based on the same fundamentals. They have been designed with the concept of structured programming in mind.