Re-inventing a Great Idea
Part of the Monographs in Computer Science book series (MCS)
As mentioned before, the concept of mutual exclusion has, ever since the early days of computing, been recognized as a central issue in taming the complexity brought about by multiprograms run on a shared installation. The reason why it became a central issue is that the primitive statements provided by actual machinery often were — and are — far too finegrained to make multiprogramming practically feasible. Thus, the mutual exclusion problem, i.e. the problem of how to build (arbitrary) coarsegrained atomic statements out of finer-grained ones, did become an urgent one. In its canonical form, the problem is:
Given a number of components, each of the formsynchronize them in such a way that at any moment in time, at most one component is engaged in its cs- fragment.$$*[ncs;cs] $$
KeywordsAtomic Statement Critical Section Mutual Exclusion Great Idea Universal Turing Machine
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer Science+Business Media New York 1999