Concurrent Programming: Algorithms, Principles, and Foundations (Record no. 46117)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 05400nam a22005177a 4500 |
| 001 - CONTROL NUMBER | |
| control field | sulb-eb0024025 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | BD-SySUS |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20160413122421.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 121228s2013 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783642320279 |
| -- | 978-3-642-32027-9 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/978-3-642-32027-9 |
| Source of number or code | doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA75.5-76.95 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UY |
| Source | bicssc |
| Subject category code | UYA |
| Source | bicssc |
| Subject category code | COM014000 |
| Source | bisacsh |
| Subject category code | COM031000 |
| Source | bisacsh |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 004.0151 |
| Edition number | 23 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Raynal, Michel. |
| Relator term | author. |
| 245 10 - TITLE STATEMENT | |
| Title | Concurrent Programming: Algorithms, Principles, and Foundations |
| Medium | [electronic resource] : |
| Remainder of title | Algorithms, Principles, and Foundations / |
| Statement of responsibility, etc. | by Michel Raynal. |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
| Place of production, publication, distribution, manufacture | Berlin, Heidelberg : |
| Name of producer, publisher, distributor, manufacturer | Springer Berlin Heidelberg : |
| -- | Imprint: Springer, |
| Date of production, publication, distribution, manufacture, or copyright notice | 2013. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | XXXII, 516 p. |
| Other physical details | online resource. |
| 336 ## - CONTENT TYPE | |
| Content type term | text |
| Content type code | txt |
| Source | rdacontent |
| 337 ## - MEDIA TYPE | |
| Media type term | computer |
| Media type code | c |
| Source | rdamedia |
| 338 ## - CARRIER TYPE | |
| Carrier type term | online resource |
| Carrier type code | cr |
| Source | rdacarrier |
| 347 ## - DIGITAL FILE CHARACTERISTICS | |
| File type | text file |
| Encoding format | |
| Source | rda |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Part I - Lock-Based Synchronization -- Chap. 1 - The Mutual Exclusion Problem -- Chap. 2 - Solving Mutual Exclusion -- Chap. 3 - Lock-Based Concurrent Objects -- Part II - On the Foundations Side: The Atomicity Concept -- Chap. 4 - Atomicity: Formal Definition and Properties -- Part III - Mutex-Free Synchronization -- Chap. 5 - Mutex-Free Concurrent Objects -- Chap. 6 - Hybrid Concurrent Objects -- Chap. 7 - Wait-Free Objects from Read/Write Registers Only -- Chap. 8 - Snapshot Objects from Read/Write Registers Only -- Chap. 9 - Renaming Objects from Read/Write Registers Only -- Part IV - The Transactional Memory Approach -- Chap. 10 - Transactional Memory -- Part V - On the Foundations Side: From Safe Bits to Atomic Registers -- Chap. 11 - Safe, Regular and Atomic Read/Write Registers -- Chap. 12 - From Safe Bits to Atomic Bits: A Lower Bound and an Optimal Construction -- Chap. 13 - Bounded Constructions of Atomic b-Valued Registers -- Part VI - On the Foundations Side: The Computability Power of Concurrent Objects (Consensus) -- Chap. 14 - Universality of Consensus -- Chap. 15 - The Case of Unreliable Base Objects -- Chap. 16 - Consensus Numbers and the Consensus Hierarchy -- Chap. 17 - The Alphas and Omega of Consensus: Failure Detector-Based Consensus -- Afterword -- Bibliography -- Index. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | 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. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science. |
| Topical term or geographic name as entry element | Computer hardware. |
| Topical term or geographic name as entry element | Computer organization. |
| Topical term or geographic name as entry element | Software engineering. |
| Topical term or geographic name as entry element | Computers. |
| Topical term or geographic name as entry element | Computer Science. |
| Topical term or geographic name as entry element | Theory of Computation. |
| Topical term or geographic name as entry element | Computer Systems Organization and Communication Networks. |
| Topical term or geographic name as entry element | Software Engineering/Programming and Operating Systems. |
| Topical term or geographic name as entry element | Computer Hardware. |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY | |
| Title | Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Relationship information | Printed edition: |
| International Standard Book Number | 9783642320262 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="http://dx.doi.org/10.1007/978-3-642-32027-9">http://dx.doi.org/10.1007/978-3-642-32027-9</a> |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | |
| Koha item type | |
No items available.