- Taschenbuch: 440 Seiten
- Verlag: Prentice Hall; Auflage: 1 (11. Mai 2006)
- Sprache: Englisch
- ISBN-10: 0131972596
- ISBN-13: 978-0131972599
- Größe und/oder Gewicht: 17,2 x 2,3 x 23,3 cm
- Durchschnittliche Kundenbewertung: Schreiben Sie die erste Bewertung
- Amazon Bestseller-Rang: Nr. 635.692 in Fremdsprachige Bücher (Siehe Top 100 in Fremdsprachige Bücher)
- Komplettes Inhaltsverzeichnis ansehen
Synchronization Algorithms and Concurrent Programming (Englisch) Taschenbuch – 11. Mai 2006
Kunden, die diesen Artikel gekauft haben, kauften auch
Es wird kein Kindle Gerät benötigt. Laden Sie eine der kostenlosen Kindle Apps herunter und beginnen Sie, Kindle-Bücher auf Ihrem Smartphone, Tablet und Computer zu lesen.
Geben Sie Ihre Mobiltelefonnummer ein, um die kostenfreie App zu beziehen.
Wenn Sie dieses Produkt verkaufen, möchten Sie über Seller Support Updates vorschlagen?
Synchronization is needed in all systems and environments where several processors (or processes) can be active at the same time. This is the case for operating systems, distributed systems, database systems, distributed computing, and multi-threading and concurrent programming languages. The different textbooks (and courses) about these systems and programming languages, all include at least one chapter (two lectures) about synchronization algorithms. This book studies synchronization techniques and algorithms, and concurrent programming concepts. It is suitable for use as core reading for courses on synchronization algorithms and/or concurrent programming. It is also ideal additional reading for courses such as distributed computing (covering many relevant topics in detail) and operating systems,when there is an interest in expanding the coverage and devoting more time to the subject of synchronization.
Synchronization Algorithms and Concurrent Programming
Synchronization is a fundamental challenge in computer science. It is fast becoming a major performance and design issue for concurrent programming on modern architectures, and for the design of distributed systems. This is the first text to give a complete and coherent view of all aspects of synchronization algorithms.
Computer science students, programmers, system designers and researchers will be able to solve problems and master techniques that go beyond the treatment provided in introductory texts on operating systems, distributed computing and concurrency. Dozens of algorithms are presented and their performance is analyzed according to precise complexity measures.
Highlights of the book include
Ø A wide variety of synchronization problems, algorithms and key concepts covered in detail.
Ø Self-review questions with solutions to check your understanding.
Ø A wealth of end-of-chapter exercises and bibliographic notes.
Ø Over 300 annotated references guiding you through the contemporary research literature.
Ø A companion website provides PowerPoint slides and other teaching and learning aids for students and instructors at www.pearsoned.co.uk/taubenfeld.
About the authorGadi Taubenfeld is an Associate Professor of Computer Science at the Interdisciplinary Center in Herzliya, Israel. He is an established authority in the area of concurrent and distributed computing and has published widely in leading journals and conferences. He was the head of the computer science division at Israel?s Open University; member of technical staff at AT&T Bell Laboratories; consultant to AT&T Labs - Research; and a research scientist and lecturer at Yale University. He holds a PhD in Computer Science from the Technion ? Israel Institute of Technology.
|5 Sterne (0%)|
|4 Sterne (0%)|
|3 Sterne (0%)|
|2 Sterne (0%)|
|1 Stern (0%)|
Die hilfreichsten Kundenrezensionen auf Amazon.com
The book is on the same level as Herlihy and Shavit's "The art of multiprocessor programming". I would recommend to read the both - it is hard to choose the better one, they both are excellent.