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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Apt, K.R., Olderog, ER. (1997). Fairness. In: Verification of Sequential and Concurrent Programs. Graduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-2714-2_9
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2714-2_9
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-2716-6
Online ISBN: 978-1-4757-2714-2
eBook Packages: Springer Book Archive