Abstract
This chapter introduces definitions related to process synchronization and focuses then on the mutual exclusion problem, which is one of the most important synchronization problems. It also defines progress conditions associated with mutual exclusion, namely deadlock-freedom and starvation-freedom.
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 subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Raynal, M. (2013). The Mutual Exclusion Problem. In: Concurrent Programming: Algorithms, Principles, and Foundations. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32027-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-32027-9_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32026-2
Online ISBN: 978-3-642-32027-9
eBook Packages: Computer ScienceComputer Science (R0)