Teoretické informácie o Distribuovaných systémoch

• 2014 - Distributed systems theory for the distributed systems engineer (****)
• Distributed systems for fun and profit - KNIHA od Mikito Takada (Rychly prehlad klucovych tem ohladom distribuovanych systemov) (****)
  “Distributed programming is the art of solving the same problem that you can solve on a single computer using multiple computers.”
• Kyle Kingsbury (Aphyr - Jepsen seria) - An introduction to distributed systems (****)
  This outline accompanies a 12-16 hour overview class on distributed systems fundamentals. The course aims to introduce software engineers to the practical basics of distributed systems, through lecture and discussion. Participants will gain an intuitive understanding of key distributed systems terms, an overview of the algorithmic landscape, and explore production concerns.
• Principles of Distributed Computing (lecture collection) (****)
  Distributed computing is essential in modern computing and communications systems. Examples are on the one hand large-scale networks such as the Internet, and on the other hand multiprocessors such as your new multi-core laptop. The lecture notes on this webpage introduce the principles of distributed computing, emphasizing the fundamental issues underlying the design of distributed systems and networks: communication, coordination, fault-tolerance, locality, parallelism, self-organization, symmetry breaking, synchronization, uncertainty. We explore essential algorithmic ideas and lower bound techniques, basically the "pearls" of distributed computing. Each chapter covers a fresh topic.
• 2013 - Notes on Distributed Systems for Young Bloods
  Below is a list of some lessons I’ve learned as a distributed systems engineer that are worth being told to a new engineer. Some are subtle, and some are surprising, but none are controversial. This list is for the new distributed systems engineer to guide their thinking about the field they are taking on. It’s not comprehensive, but it’s a good beginning.

Základné termíny a príbuzne oblasti

• ACID (Atomicity, Consistency, Isolation, Durability) vlastnosti
• Strong consistency models (***)
  Network partitions are going to happen. Switches, NICs, host hardware, operating systems, disks, virtualization layers, and language runtimes, not to mention program semantics themselves, all conspire to delay, drop, duplicate, or reorder our messages. In an uncertain world, we want our software to maintain some sense of intuitive correctness. Well, obviously we want intuitive correctness. Do The Right Thing™! But what exactly is the right thing? How might we describe it? In this essay, we’ll take a tour of some “strong” consistency models, and see how they fit together.
• 2015 - Please stop calling databases CP or AP
• 2015 - Google systems guru explains why containers are the future of computing
  Zaujimave interview s otcom CAP teoremu (Eric Brewer).
• 2012 - Eric Brewer - CAP Twelve Years Later: How the "Rules" Have Changed
• 2004 - Eric Brewer - Towards Robust Towards Robust Distributed Systems
  Prva prednaska o CAP teoreme od jeho tvorcu (Eric Brewer).

RAFT algoritmus

• The Raft Consensus Algorithm
  Raft is a consensus algorithm that is designed to be easy to understand. It's equivalent to Paxos in fault-tolerance and performance. The difference is that it's decomposed into relatively independent subproblems, and it cleanly addresses all major pieces needed for practical systems. We hope Raft will make consensus available to a wider audience, and that this wider audience will be able to develop a variety of higher quality consensus-based systems than are available today.
• Raft paper
• The Secret Lives of Data
  Pekne vizualizacie roznych algoritmov zo sveta distribuovanych systemov (zatial len RAFT).
  • What is Distributed Consensus
  • Protocol Overview
  • Leader Election
  • Log Replication
  • Other Resources
• 2017 - RAFT Explained – Part 1/3: Introduction to the Consensus Problem
• 2017 - RAFT Explained – Part 2/3: Overview of the Core Protocol
• 2017 - RAFT Explained – Part 3/3: Safety and Liveness Guarantees, Conclusion

Testy korektnosti Distribuovaných systémov

• Jepsen series on distributed systems correctnes by Aphyr (Kyle Kingsbury) (*****)
  Aphyr, or Kyle Kingsbury, is a computer safety researcher working as an independent consultant.
• JEPSEN (Kyle Kingsburry) - Distributed Systems Safety Analysis (*****)
  Jepsen is an effort to improve the safety of distributed databases, queues, consensus systems, etc. It encompasses a software library for systems testing, as well as blog posts, and conference talks exploring particular systems’ failure modes. In each post we explore whether the system lives up to its documentation’s claims, file new bugs, and suggest recommendations for operators.
  • 2013 - Survey on consistency conditions
  • 2016 - A Critical Comparison of NOSQL Databases in the Context of Acid and Base
  • Jepsen - Elasticsearch 1.1.0
  • Jepsen - Elasticsearch 1.5
  • Elasticsearch Resiliency Status - vsetky neduhy Elasticsearch v zmysle jeho odolnosti na rozne vypadky

Ďalšie zdroje informácií

• A Distributed Systems Reading List (*****)
  I often argue that the toughest thing about distributed systems is changing the way you think. The below is a collection of material I've found useful for motivating these changes.
• awesome-distributed-systems
  A (hopefully) curated list on awesome material on distributed systems, inspired by other awesome frameworks like awesome-python. Most links will tend to be readings on architecture itself rather than code itself.
• awesome-distributed-systems
  A curated list of awesome distributed systems books, papers, resources and shiny things.

Chaos Engineering

• 2016 - How Complex Web Systems Fail — Part 1
• 2016 - How Complex Web Systems Fail — Part 2
• 2014 - Chaos Engineering 101
• 2014 - Chaos Engineering: A Shift in Mindset
• 2000 - How Complex Systems Fail