Stock photo: cover may vary
Concurrent Programming: Algorithms, Principles, and Foundations Paperback - 2015
by Raynal, Michel
- Used
- Paperback
A$90.33
A$26.45
Delivery to USA
Standard delivery: 7 to 20 days
More delivery options
Standard delivery: 7 to 20 days
Ships from Anybook.com (Lincolnshire, United Kingdom)
Details
- Title Concurrent Programming: Algorithms, Principles, and Foundations
- Author Raynal, Michel
- Binding Paperback
- Pages 516
- Volumes 1
- Language ENG
- Publisher Springer
- Publication date 2015
- Illustrated Yes
- Features Bibliography, Illustrated
- Bookseller's Inventory # 9781443
- ISBN 9783642446153 / 3642446159
- Weight 1.67 lbs (0.76 kg)
- Dimensions 9.21 x 6.14 x 1.11 in (23.39 x 15.60 x 2.82 cm)
-
Themes
- Aspects (Academic): Science/Technology Aspects
- Category Computers - General Information
- Dewey Decimal Code 004
About Anybook.com Lincolnshire, United Kingdom
Biblio member since 2004
Established in 1998 Anybook.com. has sold millions of scholastic books to university libraries, academics, students and reflective bibliophiles throughout the world. As the majority of our books are ex-library they are well bound, in good, clean condition and ideally suited for study and research. Our books cover a huge range of academic disciplines from Mathematics, Science and Philosophy to Art and Literature as well as many works in other European languages.
Based in central Lincoln, Anybook.com. sells exclusively online. We specialise in academic works. All our books are in good condition or better, unless otherwise described. All the books we have on sale are to hand in our warehouses in Lincoln. Photographs and additional information on request. Books out within 1 working day. We use reputable couriers at greatly discounted postage rates. As well as Visa and Mastercard, we also accept Switch, Discover and Solo. We also accept Paypal (www.paypal.com) payments. Other methods of payment are possible but please email us for details. Remember if you are unsatisfied in any way with any purchase, we will give you a complete and unconditional refund. E-mail us if you have any questions about the service we offer. Please be aware our prices and shipping costs do not include local import taxes which may need to be paid by the customer upon receipt.
Reader reviews for Concurrent Programming: Algorithms, Principles, and Foundations
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
From the rear cover
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 majortheoretical 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.
