Concurrent Programming: Algorithms, Principles and Foundations - Couverture rigide

Raynal, Michel

Couverture rigide

ISBN 10 : 3642320260 ISBN 13 : 9783642320262

Editeur : Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 2012

Synopsis

Concurrent Programming: Algorithms, Principles, and Foundations 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

A propos du livre

Présentation de l'éditeur :

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.

Revue de presse :

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)

À propos de cette édition

• Éditeur: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
• Date d'édition: 2012
• ISBN 10: 3642320260
• ISBN 13: 9783642320262
• Reliure: Relié
• Nombre de pages: 516