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

myocardium

The Yellow Pages,sic ingredients for our method of multiprogramming. Since these ingredients are rather scattered over the various chapters, it seems appropriate that, on this divide of the book, we give a brief and rough summary of them. And this, indeed, is the primary purpose of these “Yellow Pages”.

sleep-spindles

,Peterson’s Two-Component Mutual Exclusion Algorithm,ause genuinely simple — mutual exclusion algorithm for two components. It is the one invented by G.L. Peterson [Pet81], and we shall be glad to discuss it here, not only because of its compelling elegance but also because we think that each educated computing scientist should be familiar with all the ins and outs of this algorithm.

growth-factor

Re-inventing a Great Idea,d 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:

Legion

0172-603X of how to design parallel programs from their specification. And that is what this book is about. It proposes a method for the formal development of parallel programs - multiprograms as we have preferred to call them -, and it does so with a minimum of formal gear, viz. with the predicate calculus a

拍下盜公款

可以任性

ineffectual

修剪過的樹籬

Concurrent Vector Writing: A First Exercise in Program Development,rst exercise not too much additional code will be developed, on the one hand because the current example is very simple and on the other hand because, in general, a development that is carried out with caution does not introduce more than needed.

假裝是你

falsehood