Concurrent Programming Algorithms Principles And Foundations

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 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 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 Lamports Hierarchy Of Safe, Regular And Atomic Registers And Associated Wait- Constructions; A Description Of Numerous Wait- 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 Herlihys Hierarchy; And A Survey Of Failure Detector-based Constructions Of Consensus Objects.