|Synchronization Algorithms and Concurrent Programming|
|Book Info||Product Details|
|Table of Contents||ISBN: 0131972596|
|Back Cover||Publisher: Pearson / Prentice Hall|
|Companion Website||Published: 11 May 2006|
|7 ppts, figures --||Format: Paperback|
|download below||Language: English|
|Number of pages: 433|
|Catalogue: UK , US|
|Amazon: UK , US|
|See larger photo|
June 2011: The first version of the presentation for Chapter 4 is available below.
June 2011: Updated versions of the presentations for Chapters 1,2,9 are available below.
A review of the book has appeared in
the following special issue on
The following article gives a brief overview of the
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
About the author
Gadi Taubenfeld is a 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 Institue of Technology.
The companion website will soon include valuable learning material including: