Apress

Concurrent Programming: Algorithms, Principles, and Foundations

By Michel Raynal

Concurrent Programming: Algorithms, Principles, and Foundations Cover Image

This book explains synchronization and the implementation of concurrent objects, presenting synchronization algorithms while also introducing the theory that underlies the implementation of concurrent objects in the presence of asynchrony and process crashes.

Full Description

  • ISBN13: 978-3-6423-2026-2
  • 548 Pages
  • User Level: Students
  • Publication Date: December 30, 2012
  • Available eBook Formats: PDF
  • eBook Price: $79.95
Buy eBook Buy Print Book Add to Wishlist
Full Description
The advent of new architectures and computing platforms means that synchronization and concurrent computing are among the most important topics in computing science. Concurrent programs are made up of cooperating entities -- processors, processes, agents, peers, sensors -- and synchronization is the set of concepts, rules and mechanisms that allow them to coordinate their local computations in order to realize a common task. This book is devoted to the most difficult part of concurrent programming, namely synchronization concepts, techniques and principles when the cooperating entities are asynchronous, communicate through a shared memory, and may experience failures. Synchronization is no longer a set of tricks but, due to research results in recent decades, it relies today on sane scientific foundations as explained in this book.In this book the author explains synchronization and the implementation of concurrent objects, presenting in a uniform and comprehensive way the major theoretical and practical results of the past 30 years. Among the key features of the book are a new look at lock-based synchronization (mutual exclusion, semaphores, monitors, path expressions); an introduction to the atomicity consistency criterion and its properties and a specific chapter on transactional memory; an introduction to mutex-freedom and associated progress conditions such as obstruction-freedom and wait-freedom; a presentation of Lamport's hierarchy of safe, regular and atomic registers and associated wait-free constructions; a description of numerous wait-free constructions of concurrent objects (queues, stacks, weak counters, snapshot objects, renaming objects, etc.); a presentation of the computability power of concurrent objects including the notions of universal construction, consensus number and the associated Herlihy's hierarchy; and a survey of failure detector-based constructions of consensus objects. The book is suitable for advanced undergraduate students and graduate students in computer science or computer engineering, graduate students in mathematics interested in the foundations of process synchronization, and practitioners and engineers who need to produce correct concurrent software. The reader should have a basic knowledge of algorithms and operating systems.
Table of Contents

Table of Contents

  1. Part I
  2. Lock
  3. Based Synchronization.
  4. Chap. 1
  5. The Mutual Exclusion Problem.
  6. Chap. 2
  7. Solving Mutual Exclusion.
  8. Chap. 3
  9. Lock
  10. Based Concurrent Objects.
  11. Part II
  12. On the Foundations Side: The Atomicity Concept.
  13. Chap. 4
  14. Atomicity: Formal Definition and Properties.
  15. Part III
  16. Mutex
  17. Free Synchronization.
  18. Chap. 5
  19. Mutex
  20. Free Concurrent Objects.
  21. Chap. 6
  22. Hybrid Concurrent Objects.
  23. Chap. 7
  24. Wait
  25. Free Objects from Read/Write Registers Only.
  26. Chap. 8
  27. Snapshot Objects from Read/Write Registers Only.
  28. Chap. 9
  29. Renaming Objects from Read/Write Registers Only.
  30. Part IV
  31. The Transactional Memory Approach.
  32. Chap. 10
  33. Transactional Memory.
  34. Part V
  35. On the Foundations Side: From Safe Bits to Atomic Registers.
  36. Chap. 11
  37. Safe, Regular and Atomic Read/Write Registers.
  38. Chap. 12
  39. From Safe Bits to Atomic Bits: A Lower Bound and an Optimal Construction.
  40. Chap. 13
  41. Bounded Constructions of Atomic b
  42. Valued Registers.
  43. Part VI
  44. On the Foundations Side: The Computability Power of Concurrent Objects (Consensus).
  45. Chap. 14
  46. Universality of Consensus.
  47. Chap. 15
  48. The Case of Unreliable Base Objects.
  49. Chap. 16
  50. Consensus Numbers and the Consensus Hierarchy.
  51. Chap. 17
  52. The Alphas and Omega of Consensus: Failure Detector
  53. Based Consensus.
  54. Afterword.
  55. Bibliography.
  56. Index.
Errata

If you think that you've found an error in this book, please let us know about it. You will find any confirmed erratum below, so you can check if your concern has already been addressed.

* Required Fields

No errata are currently published