Articles liés à Concurrent Programming: Algorithms, Principles and...
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
Prof. Michel Raynal is among the top researchers in the world on the topic of distributed algorithms. He is a full professor at the Université de Rennes where he founded the Distributed Algorithms research group in 1984. He has been the principal investigator in numerous related research national and international projects, and he has been invited by more than 25 universities around the world to give lectures on distributed algorithms and distributed computing. He has over 300 academic publications on this topic, and has authored a number of books on related topics. His current research interests include distributed algorithms, distributed computing systems, distributed computability and dependability; and the fundamental principles that underlie the design and the construction of distributed computing systems.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 89,99
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Concurrent Programming: Algorithms, Principles and...
Image d'archives
Concurrent Programming: Algorithms, Principles, and Foundations
Edité par
Springer, 2012
ISBN 10 : 3642320260
ISBN 13 : 9783642320262
Ancien ou d'occasion
Couverture rigide
Vendeur : ThriftBooks-Atlanta, AUSTELL, GA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.95. N° de réf. du vendeur G3642320260I4N00
Quantité disponible : 1 disponible(s)
Image d'archives
Concurrent Programming: Algorithms, Principles, and Foundations
Edité par
Springer, 2012
ISBN 10 : 3642320260
ISBN 13 : 9783642320262
Ancien ou d'occasion
Couverture rigide
Vendeur : SecondSale, Montgomery, IL, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc. N° de réf. du vendeur 00060537915
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Concurrent Programming: Algorithms, Principles, and Foundations
Edité par
Springer Berlin Heidelberg, 2012
ISBN 10 : 3642320260
ISBN 13 : 9783642320262
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Gebunden. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Among the first books on modern synchronization, a fundamental topic of computer science with the advent of multicore architectures and transactional memoryAuthor among the leading researchers in the area of distributed computingTextbook fe. N° de réf. du vendeur 5056785
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Concurrent Programming: Algorithms, Principles, and Foundations
Edité par
Springer Berlin Heidelberg, 2012
ISBN 10 : 3642320260
ISBN 13 : 9783642320262
Neuf
Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N° de réf. du vendeur 9783642320262
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Concurrent Programming: Algorithms, Principles, and Foundations
Edité par
Springer Berlin Heidelberg Dez 2012, 2012
ISBN 10 : 3642320260
ISBN 13 : 9783642320262
Neuf
Couverture rigide
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 548 pp. Englisch. N° de réf. du vendeur 9783642320262
Quantité disponible : 2 disponible(s)
Image d'archives
Concurrent Programming: Algorithms, Principles, and Foundations
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In English. N° de réf. du vendeur ria9783642320262_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Concurrent Programming: Algorithms, Principles, and Foundations
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2012, 2012
ISBN 10 : 3642320260
ISBN 13 : 9783642320262
Neuf
Couverture rigide
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 548 pp. Englisch. N° de réf. du vendeur 9783642320262
Quantité disponible : 2 disponible(s)
Image d'archives
Concurrent Programming: Algorithms, Principles, and Foundations
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9783642320262
Quantité disponible : Plus de 20 disponibles
Image d'archives
Concurrent Programming: Algorithms, Principles, and Foundations (eng)
impression à la demandeVendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Évaluation du vendeur 4 sur 5 étoiles
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur 83e24bdffc5fc6119ea156cfb7bb0067
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Concurrent Programming : Algorithms, Principles and Foundations
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 18992349-n
Quantité disponible : Plus de 20 disponibles