Titlebook: On a Method of Multiprogramming; W. H. J. Feijen,A. J. M. Gasteren Book 1999 Springer-Verlag New York 1999 Annotation.algorithm.algorithms

迅速飛過

Fraudulent

Three Theorems and Two Examples,ome of which are relevant enough to acquire the status of theorems. We start with the theorems, which happen to be the simpler exercises, and we conclude with slightly more sophisticated examples, which enable us to pay attention to . of a-posteriori proofs, an activity that is quite similar to our ultimate goal: the design of multiprograms.

sigmoid-colon

More Theorems and More Examples,vocabulary and the techniques introduced so far. There is, however, one final issue that we have hardly touched upon, viz. the problem of how to make programs more .. We already alluded to this issue when specifying the problem of Concurrent Vector Writing, but now the time has come to become a little more articulate about it.

無孔

Phase Synchronization for Two Machines,h aspects as efficiency, demand on storage space, degree of parallelism, communication density, robustness, etc.. Although these issues definitely fall outside the scope of this text, we nevertheless wish to include a very modest touch on them.

過多

The Parallel Linear Search,roblem can be used to illustrate a variety of phenomena that come with parallelism, and in this capacity it is one of the running examples in [AO91]. In [Kna92] we can find a first formal derivation of the algorithm, a derivation that is carried out in the UNITY formalism [CM88].

inferno

anus928

strdulate

The Core of the Owicki/Gries Theory,ainst operational reasoning, and how it aids in coming to firm grips with sequential programs. All these virtues become even more important now that we are on the verge of taking multiprograms into account, i.e. entire sets of cooperating sequential programs to be executed simultaneously.

perimenopause

無脊椎