A method for solving synchronization problems (Q582048): Difference between revisions

A systematic method is given for solving synchronization problems of concurrent processes. A process is considered as a sequence of atomic actions S which are preceded by a state P (precondition) and terminated by a state Q (postcondition). Correct synchronization is warranted, if pre- and postcondition of an atomic action in one process are not interferenced by atomic actions of another process. In order to guarantee the noninterference with only linear effort (in relation to the number of atomic actions) a global predicate is defined, which is newly calculated and checked for each starting action. The method comprises four steps: 1. Define the problem. 2. Outline the solution. 3. Ensure the global predicate. 4. Implement the atomic action. In the fourth step the action is transformed in code of only sequential statements and the synchronization mechanism. The method is illustrated for critical sections, the producer/consumer problem and the reader/writer problem. As basic synchronization mechanisms are used and explained in detail chainging variables, split binary semaphores and passing the baton.