caryc
commented
7 years ago Can't tell if I'm hijacking this, sorry if I am.
I think I might read this (got some other stuff to do first), and I think I'll want to keep these two links handy when I do, because they give high level overviews of some stuff and talk about some practical stuff involved in running distributed systems (which the book might too, I don't know):
https://github.com/aphyr/distsys-class https://www.somethingsimilar.com/2013/01/14/notes-on-distributed-systems-for-young-bloods/
https://smile.amazon.com/gp/product/0262026775/
This book offers students and researchers a guide to distributed algorithms that emphasizes examples and exercises rather than the intricacies of mathematical models. It avoids mathematical argumentation, often a stumbling block for students, teaching algorithmic thought rather than proofs and logic. This approach allows the student to learn a large number of algorithms within a relatively short span of time. Algorithms are explained through brief, informal descriptions, illuminating examples, and practical exercises. The examples and exercises allow readers to understand algorithms intuitively and from different perspectives. Proof sketches, arguing the correctness of an algorithm or explaining the idea behind fundamental results, are also included. An appendix offers pseudocode descriptions of many algorithms.