Why Are Distributed Systems so Hard?

Wednesday, March 27, 2019 - 5:00 pm5:30 pm

Denise Yu, Pivotal

Abstract: 

Distributed systems are known for being notoriously difficult to wrangle. But why? This talk will cover a brief history of distributed databases, clear up some common myths about the CAP theorem, dig into why network partitions are inevitable, and close out by highlighting how a few popular consensus algorithms mitigate the risks of operating in a distributed fashion. Almost all slides will contain original illustration featuring mischievous cats masquerading as sysadmins. By the end of this talk you will have a better understanding of the design trade-offs involved in architecting for distributed systems, and hopefully, be inspired to start doodling tech concepts!

Denise Yu, Pivotal

Denise is a software engineer who occasionally wears a product management hat at Pivotal R&D in Toronto. Denise has previously delivered conference talks on topics ranging from continuous delivery to functional programming to scaling company culture. She enjoys learning about distributed systems, release engineering, and low-level Linux kernel programming, and when she's not coding, she is often doodling sketch notes that break down technical concepts into digestible pieces at deniseyu.io/art.

BibTeX
@conference {229519,
author = {Denise Yu},
title = {Why Are Distributed Systems so Hard?},
year = {2019},
address = {Brooklyn, NY},
publisher = {{USENIX} Association},
}