Book Review of Synchronization Algorithms and Concurrent Programming Author of Book: Gadi Taubenfeld Publisher: Pearson / Prentice Hall, 2006, 433 pages Reviewed by Danny Hendler, Ben-Gurion University, hendlerd@cs.bgu.ac.il Introduction Although there are quite a few books that deal with various aspects of the theory and practice of multiprocessor synchronization, only a handful of them fall into the category of textbooks ([2, 13, 18] are notable examples); Gadi Taubenfeld s recent book, Synchronization Algorithms and Concurrent Programming , is certainly one of them. Taubenfeld s book focuses on inter-process synchronization in shared-memory systems. The book provides an in-depth discussion of algorithms and lower bounds for a wide range of synchronization problems, such as mutual exclusion, barrier synchronization, l -exclusion, deadlock-prevention, the dining philosophers problem, the producer-consumer problem, consensus, and many more. As stated in its preface, the book is meant to be used as a textbook for upper-level undergraduate or graduate courses and special emphasis has been given to make it accessible to a wide audience. The book s structure and methodology re ect these goals in several ways: ¢ The book is mostly self-contained. ¢ Each section ends with a set of self review questions and their
/lp/association-for-computing-machinery/book-review-of-synchronization-algorithms-and-concurrent-programming-VEQfslOJGk