Synchronization Algorithms and Concurrent Programming

http://www.faculty.idc.ac.il/gadi/book.htm

Table of Contents

Preface

Key Features

1. Introduction

2. Mutual exclusion using atomic registers: basic topics

3. Mutual exclusion using atomic registers: advanced topics

4. Blocking and non-blocking synchronization

5. Barrier synchronization

6. The l-exclusion problem

7. Multiple resources

8. Classical synchronization problems

9. Consensus

10. Timing-based algorithms

Bibliography

Index

Back Cover

Synchronization is a fundamental challenge in computer science. It is fast becoming a major performance and design issue for concurrent programming on modern architectures, and for the design of distributed systems. This is the first text to give a complete and coherent view of all aspects of synchronization algorithms.

Computer science students, programmers, system designers and researchers will be able to solve problems and master techniques that go beyond the treatment provided in introductory texts on operating systems, distributed computing and concurrency. Dozens of algorithms are presented and their performance is analyzed according to precise complexity measures.

Highlights of the book include

* A wide variety of synchronization problems, algorithms and key concepts are covered in detail.

* Self-review questions with solutions to check your understanding.

* A wealth of end-of-chapter exercises and bibliographic notes.

* Over 300 annotated references guiding you through the contemporary research literature.

* A Companion Website provides PowerPoint slides and other teaching and learning aids for students and instructors at pearsoned.co.uk/taubenfeld.