Concurrent Programming: Algorithms, Principles, and Foundations

Nonfiction, Computers, Computer Hardware, Input-Output Equipment, Advanced Computing, Computer Science, General Computing
Cover of the book Concurrent Programming: Algorithms, Principles, and Foundations by Michel Raynal, Springer Berlin Heidelberg
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Michel Raynal ISBN: 9783642320279
Publisher: Springer Berlin Heidelberg Publication: December 30, 2012
Imprint: Springer Language: English
Author: Michel Raynal
ISBN: 9783642320279
Publisher: Springer Berlin Heidelberg
Publication: December 30, 2012
Imprint: Springer
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Springer Berlin Heidelberg

Cover of the book Intestinal Anastomoses with Bioabsorbable Anastomosis Rings by Michel Raynal
Cover of the book Analysis of Urban Growth and Sprawl from Remote Sensing Data by Michel Raynal
Cover of the book Spatial Data Analysis by Michel Raynal
Cover of the book The 19th International Conference on Industrial Engineering and Engineering Management by Michel Raynal
Cover of the book Informationstechnologie für Ingenieure by Michel Raynal
Cover of the book Statistik angewandt by Michel Raynal
Cover of the book Perturbation Theory for Linear Operators by Michel Raynal
Cover of the book Industrielle Kostenrechnung by Michel Raynal
Cover of the book Integrative Pediatric Oncology by Michel Raynal
Cover of the book The Naïve Bayes Model for Unsupervised Word Sense Disambiguation by Michel Raynal
Cover of the book Quantum Dots for DNA Biosensing by Michel Raynal
Cover of the book Signal Conditioning by Michel Raynal
Cover of the book Betreuung von Dialysepatienten by Michel Raynal
Cover of the book Innovation performance accounting by Michel Raynal
Cover of the book Neural Fields by Michel Raynal
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy