Synchronization Algorithms and Concurrent Programming

Synchronization Algorithms and Concurrent Programming is written by Gadi Taubenfeld. 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. 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; and a companion website provides Power Point slides and other teaching and learning aids for students and instructors. About the author: Gadi 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.