As we have seen in the zero search example of Chapter 1, fairness is an important hypothesis in the study of parallel programs Fairness models the idea of “true parallelism,” where every component of a parallel program progresses with unknown, but positive speed. In other words, every component eventually executes its next enabled atomic instruction.
KeywordsRandom Assignment Proof System Total Correctness Proof Outline Proof Rule
Unable to display preview. Download preview PDF.