Goodreads helps you keep track of books you want to read.
Start by marking “Synchronization Algorithms and Concurrent Programming” as Want to Read:
Synchronization Algorithms and Concurrent Programming
Enlarge cover
Rate this book
Clear rating
Open Preview

Synchronization Algorithms and Concurrent Programming

4.5  ·  Rating details ·  4 Ratings  ·  0 Reviews
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 ...more
Paperback, 423 pages
Published July 1st 2006 by Prentice Hall
More Details... edit details

Friend Reviews

To see what your friends thought of this book, please sign up.

Reader Q&A

Be the first to ask a question about Synchronization Algorithms and Concurrent Programming

This book is not yet featured on Listopia. Add this book to your favorite list »

Community Reviews

(showing 1-27)
Rating details
Sort: Default
|
Filter
Daniel
rated it really liked it
Aug 24, 2012
Tomek Kalinowski
rated it it was amazing
Jan 29, 2016
Guanyum
rated it really liked it
Dec 03, 2013
Francisco Eduardo Alves
rated it it was amazing
Jun 29, 2015
Chris Hanson
marked it as to-read
Jun 18, 2009
·
marked it as to-read
Dec 09, 2010
Dmitry
marked it as to-read
Aug 23, 2012
Fang-rui Song
marked it as to-read
Jul 20, 2013
Gal Bar
marked it as to-read
Jun 22, 2014
Marcin Sobieszczanski
marked it as to-read
Aug 03, 2014
Eldric Liew
marked it as to-read
Mar 31, 2016
Bondoc
marked it as to-read
Oct 24, 2016
Saba
marked it as to-read
Nov 06, 2016
Daniel Peer
marked it as to-read
Dec 03, 2016
Javier
marked it as to-read
Mar 24, 2017
Foo Bar
marked it as to-read
Feb 17, 2018
Nikhil
marked it as to-read
Mar 03, 2018
Rizwan Jan
marked it as to-read
Apr 22, 2018
There are no discussion topics on this book yet. Be the first to start one »