On Saturday, 25 February 2017 08:37:31 UTC+2, Marwan abdel moneim wrote: > > Algorithms like Peterson’s algorithm > <http://cs.nyu.edu/~lerner/spring12/Read03-MutualExclusion.pdf> and others > <https://www.amazon.com/Synchronization-Algorithms-Concurrent-Programming-Taubenfeld/dp/0131972596>, > > which i think was developed before languages provide Mutexes or Channels > (or something similar) > > If i want to be able to develop complex concurrent programs, should i > study those algorithms? or is it a waste of time? >
It depends on what you mean by "complex concurrent programs"... It's always useful to study different approaches. So, it cannot hurt. The best book about locks I've encountered is "The Little Book of Semaphores" - http://greenteapress.com/wp/semaphores/ + Egon -- You received this message because you are subscribed to the Google Groups "golang-nuts" group. To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
