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

GREG

小丑

The Safe Sluice: A Synthesis Emerging,ow a method can emerge from a careful study of a judiciously chosen, simple algorithm like the Safe Sluice. For us, authors, the exploration of this algorithm created the first evidence that the Owicki/Gries theory could, somehow, effectively be put at work for the formal derivation of multi-program

agglomerate

,Peterson’s Two-Component Mutual Exclusion Algorithm,earch for new, better or different such algorithms has continued. It took the computing community about twenty years to come up with a beautiful — because genuinely simple — mutual exclusion algorithm for two components. It is the one invented by G.L. Peterson [Pet81], and we shall be glad to discus

extinct

Re-inventing a Great Idea,plexity 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.

curettage

LUCY

農(nóng)學(xué)

ENDOW

BLA

CAPE