Synchronization Algorithms and Concurrent Programming

Gadi Taubenfeld

422 pages, parution le 20/07/2006

Ajouter à une liste

Indisponible

Résumé

Synchronization is needed in all systems and environments where several processors (or processes) can be active at the same time. This is the case for operating systems, distributed systems, database systems, distributed computing, and multi-threading and concurrent programming languages. The different textbooks (and courses) about these systems and programming languages, all include at least one chapter (two lectures) about synchronization algorithms.

This book studies synchronization techniques and algorithms, and concurrent programming concepts. It is suitable for use as core reading for courses on synchronization algorithms and/or concurrent programming. It is also ideal additional reading for courses such as distributed computing (covering many relevant topics in detail) and operating systems,when there is an interest in expanding the coverage and devoting more time to the subject of synchronization.

Sommaire

Preface
Key Features
Introduction
Mutual Exclusion Using Atomic Registers: Basic Topics
Mutual Exclusion Using Atomic Registers: Advanced Topics
Blocking and Non-blocking Synchronization
Barrier Synchronization
The l-exclusion Problem
Multiple Resources
Classical Synchronization Problems
Consensus
Timing-based Algorithms
Bibliography
Index

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Pearson
Auteur(s)	Gadi Taubenfeld
Parution	20/07/2006
Nb. de pages	422
Format	17 x 23,5
Couverture	Broché
Poids	728g
Intérieur	Noir et Blanc
EAN13	9780131972599
ISBN13	978-0-13-197259-9