Authors:
- Among the first books on modern synchronization, a fundamental topic of computer science with the advent of multicore architectures and transactional memory
- Author among the leading researchers in the area of distributed computing
- Textbook features include summaries, keywords, bibliographic notes and exercises for each chapter
- Includes supplementary material: sn.pub/extras
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (17 chapters)
-
Front Matter
-
Lock-Based Synchronization
-
Front Matter
-
-
On the Foundations Side: The Atomicity Concept
-
Front Matter
-
-
On the Foundations Side: the Atomicity Concept
-
The Transactional Memory Approach
-
Front Matter
-
-
On the Foundations Side: From Safe Bits to Atomic Registers
-
Front Matter
-
-
On the Foundations Side: from Safe Bits to Atomic Registers
-
On the Foundations Side: The Computability Power of Concurrent Objects (Consensus)
-
Front Matter
-
About this book
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.
Reviews
From the reviews:
“Concurrent programming is the study of the methods which will ensure correct interactions. … Raynal (Univ. of Rennes, France) presents these classical techniques at the beginning of his book, and then moves on to cover such topics as transactional memory and current areas of research like consensus in the face of crash failures. The coverage is very up-to-date, including references through 2010. … This would be an ideal text for a beginning graduate course. Summing Up: Highly recommended. Graduate students, researchers/faculty, and professionals/practitioners.” (P. Cull, Choice, Vol. 50 (11), August, 2013)
“A very comprehensive treatment of both fundamentals and recent results in concurrent programming is presented in this book. … The book is well structured, with many examples to help the reader. Each chapter starts with a short presentation of the content and a list of keywords, and concludes with a summary of the main points and results. … I can recommend this book … .” (Sergei Gorlatch, Computing Reviews, June, 2013)
Authors and Affiliations
-
, IRISA-ISTIC, Institut Universitaire de France, Rennes Cedex, France
Michel Raynal
About the author
Bibliographic Information
Book Title: Concurrent Programming: Algorithms, Principles, and Foundations
Authors: Michel Raynal
DOI: https://doi.org/10.1007/978-3-642-32027-9
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag GmbH Germany, part of Springer Nature 2013
Hardcover ISBN: 978-3-642-32026-2Published: 23 December 2012
Softcover ISBN: 978-3-642-44615-3Published: 29 January 2015
eBook ISBN: 978-3-642-32027-9Published: 30 December 2012
Edition Number: 1
Number of Pages: XXXII, 516
Topics: Theory of Computation, Computer Systems Organization and Communication Networks, Software Engineering/Programming and Operating Systems, Computer Hardware