The text book used in the KTH course is:
Christian Cachin, Rachid Guerraoui, and Luis Rodrigues
Springer, 2011, ISBN 978-3-642-15259-7
A digital version of the book is available to KTH students by logging in with your KTH account at http://link.springer.com.focus.lib.kth.se/book/10.1007/978-3-642-15260-3/page/1.
All the material covered in the lecture notes should be well-understood. If an algorithm or proof was described informally, you should refer to the book and understand it thoroughly.
You should carefully read all chapters of the book. You should try to solve all the exercises on your own and only afterwards consult the solutions sections.
Mapping between lectures and chapters in the book
|2. Formal models||Some from ch 1, but most is not in the book|
|3. Basic abstractions||Ch 2|
|4. Failure detectors||Ch 2|
|5. Reliable broadcast||Ch 3|
|6. Causal broadcast||Ch 3, 3.9|
|7, 8. Shared memory||Ch 4|
|9. Consensus with failure detectors||Ch 5|
|10. Paxos consensus||Not covered in book, but similar to epoch consensus in 5.3|
|11. Replicated state machine, reconfiguration||Not covered, but 6.1 is still related|
|12. Self-stabilizing systems||Not covered|
|13. Applications of consensus||Taken from ch 6|