Fairness

  • Krzysztof R. Apt
  • Ernst-Rüdiger Olderog
Part of the Graduate Texts in Computer Science book series (TCS)

Abstract

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.

Keywords

Random Assignment Proof System Total Correctness Proof Outline Proof Rule 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • Krzysztof R. Apt
    • 1
  • Ernst-Rüdiger Olderog
    • 2
  1. 1.Centrum voor Wiskunde en InformaticaStichling Mathematisch CentrumAmsterdamThe Netherlands
  2. 2.Fachbereich 10-Theoretische InformatikChristian Albrechts UniversityOldenburgGermany

Personalised recommendations