Tweet
Tweet

Slide 1

Slide 1 text

Building Scalable Stateful Services

Slide 2

Slide 2 text

Caitie McCaffrey Distributed Systems Engineer @caitie caitiem.com

Slide 3

Slide 3 text

Stateless Services Service

Slide 4

Slide 4 text

Stateless Services Service

Slide 5

Slide 5 text

Stateless Services Service Service

Slide 6

Slide 6 text

Stateless Services Service Service

Slide 7

Slide 7 text

Stateless Services Service Service

Slide 8

Slide 8 text

Stateless Services Service Service Service

Slide 9

Slide 9 text

Stateless Services Service Service Service

Slide 10

Slide 10 text

Stateless Services Service Service Service

Slide 11

Slide 11 text

Stateless Services Service Service Service Service

Slide 12

Slide 12 text

Stateless Services Service Service Service Service

Slide 13

Slide 13 text

Stateless Services Service Service Service Service

Slide 14

Slide 14 text

Stateless Services Service Service Service Service Service

Slide 15

Slide 15 text

Stateless Services Service Service Service Service Service

Slide 16

Slide 16 text

Data Shipping Paradigm Service Service Service

Slide 17

Slide 17 text

Data Shipping Paradigm Service Service Service

Slide 18

Slide 18 text

Data Shipping Paradigm Service Service Service

Slide 19

Slide 19 text

Data Shipping Paradigm Service Service Service

Slide 20

Slide 20 text

Data Shipping Paradigm Service Service Service

Slide 21

Slide 21 text

Data Shipping Paradigm Service Service Service

Slide 22

Slide 22 text

Data Shipping Paradigm Service Service Service

Slide 23

Slide 23 text

Data Shipping Paradigm Service Service Service

Slide 24

Slide 24 text

Data Shipping Paradigm Service Service Service

Slide 25

Slide 25 text

Data Shipping Paradigm Service Service Service

Slide 26

Slide 26 text

Data Shipping Paradigm Service Service Service

Slide 27

Slide 27 text

Data Shipping Paradigm Service Service Service

Slide 28

Slide 28 text

Data Shipping Paradigm Service Service Service

Slide 29

Slide 29 text

Data Shipping Paradigm Service Service Service

Slide 30

Slide 30 text

Data Shipping Paradigm Service Service Service

Slide 31

Slide 31 text

Service Service Service Service Service Service Service Front End Data Shipping Paradigm

Slide 32

Slide 32 text

Service Service Service Service Service Service Service Front End Data Shipping Paradigm

Slide 33

Slide 33 text

Service Service Service Service Service Service Service Front End Data Shipping Paradigm

Slide 34

Slide 34 text

Service Service Service Service Service Service Service Front End Data Shipping Paradigm

Slide 35

Slide 35 text

Service Service Service Service Service Service Service Front End Data Shipping Paradigm

Slide 36

Slide 36 text

Service Service Service Service Service Service Service Front End Data Shipping Paradigm

Slide 37

Slide 37 text

Service Service Service Service Service Service Service Front End Data Shipping Paradigm

Slide 38

Slide 38 text

Service Service Service Service Service Service Service Front End Data Shipping Paradigm

Slide 39

Slide 39 text

Overview Benefits Building Real World Caution

Slide 40

Slide 40 text

Data Locality For Low Latency & Data Intensive Services

Slide 41

Slide 41 text

Function Shipping Paradigm Service Service Service

Slide 42

Slide 42 text

Function Shipping Paradigm Service Service Service

Slide 43

Slide 43 text

Function Shipping Paradigm Service Service Service

Slide 44

Slide 44 text

Function Shipping Paradigm Service Service Service

Slide 45

Slide 45 text

Function Shipping Paradigm Service Service Service

Slide 46

Slide 46 text

Function Shipping Paradigm Service Service Service

Slide 47

Slide 47 text

Function Shipping Paradigm Service Service Service

Slide 48

Slide 48 text

Function Shipping Paradigm Service Service Service

Slide 49

Slide 49 text

Function Shipping Paradigm Service Service Service

Slide 50

Slide 50 text

Function Shipping Paradigm Service Service Service

Slide 51

Slide 51 text

Function Shipping Paradigm Service Service Service

Slide 52

Slide 52 text

Service Service Service Service Service Service Service Front End Data Shipping Paradigm

Slide 53

Slide 53 text

Service Service Service Service Service Service Service Front End Data Shipping Paradigm

Slide 54

Slide 54 text

Service Service Service Service Service Service Service Front End Data Shipping Paradigm

Slide 55

Slide 55 text

Just Put A Cache On It?

Slide 56

Slide 56 text

Service Service Service Service Service Service Service Front End Cache

Slide 57

Slide 57 text

Service Service Service Service Service Service Service Front End Cache

Slide 58

Slide 58 text

Service Service Service Service Service Service Service Front End Cache

Slide 59

Slide 59 text

Concurrency Issues Greater Operational Burden Problems with Caching

Slide 60

Slide 60 text

Sticky Connections & Consistency Additional Available Consistency Models

Slide 61

Slide 61 text

Sticky Connections

Slide 62

Slide 62 text

Sticky Connections

Slide 63

Slide 63 text

Linearizable Sequential Causal Pipelined Random Access Memory Read Your Write Monotonic Read Monotonic Write Write From Read Consistency Models CP Consistency AP Consistency

Slide 64

Slide 64 text

Linearizable Sequential Causal Pipelined Random Access Memory Read Your Write Monotonic Read Monotonic Write Write From Read CP Consistency AP Consistency AP Consistency w/ Sticky Connections Consistency Models

Slide 65

Slide 65 text

- Werner Vogel 2007 “Whether or not read-your-write, session and monotonic consistency can be achieved depends in general on the "stickiness" of clients to the server that executes the distributed protocol for them… Using sessions, which are sticky, makes this explicit and provides an exposure level that clients can reason about.”

Slide 66

Slide 66 text

Building Sticky Connections For Low Latency & Data Intensive Services

Slide 67

Slide 67 text

Building Sticky Connections

Slide 68

Slide 68 text

Building Sticky Connections

Slide 69

Slide 69 text

Persistent Connections Load Balancing Problems No Stickiness Once Connection Breaks Problems

Slide 70

Slide 70 text

Persistent Connections Load Balancing Problems No Stickiness Once Connection Breaks Problems

Slide 71

Slide 71 text

Routing Logic • Cluster Membership • Work Distribution Problems to Solve

Slide 72

Slide 72 text

Routing Logic • Cluster Membership • Work Distribution Problems to Solve

Slide 73

Slide 73 text

Routing Logic • Cluster Membership • Work Distribution Problems to Solve

Slide 74

Slide 74 text

Cluster Membership Dynamic Static

Slide 75

Slide 75 text

Static Cluster Membership Machine Outage means Partial Service Outage Downtime to Add Capacity

Slide 76

Slide 76 text

Static Cluster Membership Machine Outage means Partial Service Outage Downtime to Add Capacity

Slide 77

Slide 77 text

Static Cluster Membership Machine Outage means Partial Service Outage Downtime to Add Capacity

Slide 78

Slide 78 text

Dynamic Cluster Membership Fault Tolerance

Slide 79

Slide 79 text

Dynamic Cluster Membership Fault Tolerance

Slide 80

Slide 80 text

Dynamic Cluster Membership Fault Tolerance

Slide 81

Slide 81 text

Dynamic Cluster Membership Fault Tolerance

Slide 82

Slide 82 text

Dynamic Cluster Membership Fault Tolerance

Slide 83

Slide 83 text

Dynamic Cluster Membership Gossip Protocols Consensus Systems Availability vs Consistency

Slide 84

Slide 84 text

Consensus Systems for Consistency Paxos ETCD Zookeeper Raft

Slide 85

Slide 85 text

Gossip Protocols for Availability • Assumes Non-Reliable Networks • Information Dissemination • Pairwise Communication

Slide 86

Slide 86 text

Gossip Protocols for Availability • Assumes Non-Reliable Networks • Information Dissemination • Pairwise Communication

Slide 87

Slide 87 text

Gossip Protocols for Availability • Assumes Non-Reliable Networks • Information Dissemination • Pairwise Communication

Slide 88

Slide 88 text

Gossip Protocols for Availability • Assumes Non-Reliable Networks • Information Dissemination • Pairwise Communication

Slide 89

Slide 89 text

Gossip Protocols for Availability • Assumes Non-Reliable Networks • Information Dissemination • Pairwise Communication

Slide 90

Slide 90 text

Gossip Protocols for Availability • Assumes Non-Reliable Networks • Information Dissemination • Pairwise Communication

Slide 91

Slide 91 text

Gossip Protocols for Availability • Assumes Non-Reliable Networks • Information Dissemination • Pairwise Communication

Slide 92

Slide 92 text

Gossip Protocols for Availability • Assumes Non-Reliable Networks • Information Dissemination • Pairwise Communication

Slide 93

Slide 93 text

Gossip Protocols for Availability • Assumes Non-Reliable Networks • Information Dissemination • Pairwise Communication

Slide 94

Slide 94 text

Work Distribution Consistent Hashing Distributed Hash Tables Random Placement

Slide 95

Slide 95 text

Random Placement Write Anywhere Read from Everywhere

Slide 96

Slide 96 text

Random Placement Write Anywhere Read from Everywhere

Slide 97

Slide 97 text

Random Placement Write Anywhere Read from Everywhere

Slide 98

Slide 98 text

Random Placement Write Anywhere Read from Everywhere

Slide 99

Slide 99 text

Random Placement Write Anywhere Read from Everywhere

Slide 100

Slide 100 text

Random Placement Write Anywhere Read from Everywhere

Slide 101

Slide 101 text

Random Placement Write Anywhere Read from Everywhere

Slide 102

Slide 102 text

Consistent Hashing Deterministic Placement Node A Node B Node C NodeD Consistent Hashing & Random Trees: Distributed caching protocols for relieving hot spots on the World Wide Web

Slide 103

Slide 103 text

Consistent Hashing Deterministic Placement Node A Node B NodeD Consistent Hashing & Random Trees: Distributed caching protocols for relieving hot spots on the World Wide Web

Slide 104

Slide 104 text

Consistent Hashing Deterministic Placement Node A Node B NodeD Consistent Hashing & Random Trees: Distributed caching protocols for relieving hot spots on the World Wide Web

Slide 105

Slide 105 text

Distributed Hash Table Non- Deterministic Placement Node B Node A Node C

Slide 106

Slide 106 text

Distributed Hash Table Non- Deterministic Placement Node B Node A Node C

Slide 107

Slide 107 text

Distributed Hash Table Non- Deterministic Placement Node B Node A Node C

Slide 108

Slide 108 text

Distributed Hash Table Non- Deterministic Placement Node B Node A Node C

Slide 109

Slide 109 text

Distributed Hash Table Non- Deterministic Placement Node B Node A Node C

Slide 110

Slide 110 text

Stateful Services In the Real World

Slide 111

Slide 111 text

Scuba is a fast, scalable, distributed, in-memory database built at Facebook. It is the workhorse behind code regression analysis & bug report, revenue, and performance debugging Fan-out request to all machines in the cluster Compose Results Return Results and Completeness

Slide 112

Slide 112 text

Scuba is a fast, scalable, distributed, in-memory database built at Facebook. It is the workhorse behind code regression analysis & bug report, revenue, and performance debugging Fan-out request to all machines in the cluster Compose Results Return Results and Completeness

Slide 113

Slide 113 text

Scuba is a fast, scalable, distributed, in-memory database built at Facebook. It is the workhorse behind code regression analysis & bug report, revenue, and performance debugging Fan-out request to all machines in the cluster Compose Results Return Results and Completeness

Slide 114

Slide 114 text

Uber Ringpop is an open- source Node.js library that brings application-layer sharding to many of their dispatching platform services. Swim Gossip Protocol Consistent Hashing +

Slide 115

Slide 115 text

Uber Ringpop is an open- source Node.js library that brings application-layer sharding to many of their dispatching platform services. Swim Gossip Protocol Consistent Hashing +

Slide 116

Slide 116 text

Uber Ringpop is an open- source Node.js library that brings application-layer sharding to many of their dispatching platform services. Swim Gossip Protocol Consistent Hashing +

Slide 117

Slide 117 text

Orleans Cluster Orleans is a runtime and Programming model for building distributed systems based on the Actor Model from the eXtreme Computing Group at MSR Gossip Protocol Consistent Hashing + + Distributed Hash Table Actor Actor Actor Actor Actor

Slide 118

Slide 118 text

Orleans Cluster Orleans is a runtime and Programming model for building distributed systems based on the Actor Model from the eXtreme Computing Group at MSR Gossip Protocol Consistent Hashing + + Distributed Hash Table Actor Actor Actor Actor Actor

Slide 119

Slide 119 text

Orleans Cluster Orleans is a runtime and Programming model for building distributed systems based on the Actor Model from the eXtreme Computing Group at MSR Gossip Protocol Consistent Hashing + + Distributed Hash Table Actor Actor Actor Actor Actor

Slide 120

Slide 120 text

Orleans Cluster Orleans Distributed Hash Table

Slide 121

Slide 121 text

Orleans Cluster Orleans Distributed Hash Table

Slide 122

Slide 122 text

Orleans Cluster Orleans Distributed Hash Table

Slide 123

Slide 123 text

Orleans Cluster Orleans Distributed Hash Table

Slide 124

Slide 124 text

Orleans Cluster Orleans Distributed Hash Table

Slide 125

Slide 125 text

Orleans Cluster Orleans Distributed Hash Table

Slide 126

Slide 126 text

Orleans Cluster Orleans Distributed Hash Table

Slide 127

Slide 127 text

Orleans Cluster Orleans Distributed Hash Table

Slide 128

Slide 128 text

Caution Stateful Services Ahead

Slide 129

Slide 129 text

Unbounded Data Structures Implicit Assumptions are the Killer of Distributed Systems

Slide 130

Slide 130 text

Memory Management Get Ready to Make Friends with the Garbage Collector Profiler

Slide 131

Slide 131 text

Reloading State • First Connection • Recovering From Crashes • Deploying New Code

Slide 132

Slide 132 text

Fast Restarts at Facebook “Our Key Observation is that we can decouple the memory lifetime from the process lifetime. When we shutdown a server for a planned upgrade.”

Slide 133

Slide 133 text

Make Assumptions Explicit for Reliable Distributed Systems

Slide 134

Slide 134 text

Conclusion Data Locality & Available Consistency Cluster Membership & Work Distribution Successful Stateful Real World Systems Caution: Some New Challenges

Slide 135

Slide 135 text

https://github.com/CaitieM20/ScalingStatefulServices @Caitie Questions

Slide 136

Slide 136 text

No content