Building Adaptive Systems

06f8b41980eb4c577fa40c41d5030c19?s=47 Chris Keathley
May 28, 2020
Programming
12
430

Building Adaptive Systems

06f8b41980eb4c577fa40c41d5030c19?s=128

Chris Keathley

May 28, 2020
Tweet

More Decks by Chris Keathley

See All by Chris Keathley
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
2
310
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
1
410
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
5
740
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
4
630
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
0
170
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
0
47
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
0
220
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
0
110
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
2
210

Other Decks in Programming

See All in Programming
88493e31e8ac7540094d35f7cda46c8a?s=48 lnit
8
3.2k
A38e9ebe0e62fd6753f555c005ea6551?s=48 tarukosu
0
120
B7caf463b7dbc6c305ba290ec3c16521?s=48 eroispaziali
0
300
9af444e4e7110845f0b3319efb1ca252?s=48 920oj
1
680
7eca3e06edc3c69004aaf57de51900c2?s=48 ajstarks
2
310
3295d80faee461db1093982361256fe4?s=48 panini
0
100
6f411237444fb0f49c63baeb9c5f2a38?s=48 yusukeiwaki
0
110
0fb2ce77513181750c384115cd0bc937?s=48 ksukenobe
0
150
9cbac3a8b2ea3f8f9c79d01aeb050ad3?s=48 shikugawa
1
670
252e6c31a6452aa80deb9ad0107975c7?s=48 attakei
0
190
D360f2c7f29fa7e28e3e648031fbe2f3?s=48 kajyuuen
0
110
41a66760b3483d518d9e48a7da37f91b?s=48 shibadog1121
9
1.7k

Featured

See All Featured
8081b26e05bb4354f7d65ffc34cbbd67?s=48 chriscoyier
498
130k
5f83ef806155b403c3393160ce51f955?s=48 jlugia
215
16k
F57e2136eb9895eb95ff5dc8a1c02677?s=48 zakiwarfel
87
3.2k
4394ceb8b277f35ee3da7030384efb5d?s=48 davidbonilla
68
3.4k
A0517b08532aec8ab2aae3f65d40ad86?s=48 hannesfritz
26
850
6804f1775cb4babfcc3851298566fbce?s=48 tanoku
84
8.3k
C51b39fa3c79ccb99dcb8a076bc98287?s=48 brianwarren
83
4.5k
E4f5d494ebdc9e7cce1aecf3ce3e8bc1?s=48 shpigford
163
18k
433acaea1012b25d97ae66da9b998dad?s=48 malarkey
391
60k
11c84dff30266b907714802088852677?s=48 jasonvnalue
80
7.8k
027d1ebf66cc039a0bd3b55eeadbe75d?s=48 sachag
266
16k
32de0bd2ba869609d26fd052a4622778?s=48 cromwellryan
99
5.7k

Transcript

  1. Chris Keathley / @ChrisKeathley / c@keathley.io Building Adaptive Systems

  2. Server Server

  3. Server Server I have a request

  4. Server Server

  5. Server Server

  6. Server Server No Problem!

  7. Server Server

  8. Server Server Thanks!

  9. Server Server

  10. Server Server I have a request

  11. Server Server

  12. Server Server

  13. Server Server I’m a little busy

  14. Server Server I’m a little busy I have more requests!

  15. Server Server I’m a little busy I have more requests!

  16. Server Server I’m a little busy I have more requests!

  17. Server Server I’m a little busy I have more requests!

  18. Server Server I’m a little busy I have more requests!

  19. Server Server I’m a little busy I have more requests!

  20. Server Server I’m a little busy I have more requests!

  21. Server Server I’m a little busy I have more requests!

  22. Server Server I don’t feel so good

  23. Server

  24. Server Welp

  25. Server Welp

  26. All services have objectives

  27. A resilient service should be able to withstand a 10x

    traffic spike and continue to meet those objectives

  28. Lets Talk About… Queues Overload Mitigation Adaptive Concurrency

  29. Lets Talk About… Queues Overload Mitigation Adaptive Concurrency

  30. What causes overload?

  31. What causes overload? Server Queue

  32. What causes overload? Server Queue Processing Time Arrival Rate >

  33. Little’s Law Elements in the queue = Arrival Rate *

    Processing Time

  34. Little’s Law Server 1 requests = 10 rps * 100

    ms 100ms

  35. Little’s Law Server 1 requests = 10 rps * 100

    ms 100ms

  36. Little’s Law Server 1 requests = 10 rps * 100

    ms 100ms

  37. Little’s Law Server 2 requests = 10 rps * 200

    ms 200ms

  38. Little’s Law Server 2 requests = 10 rps * 200

    ms 200ms

  39. Little’s Law Server 2 requests = 10 rps * 200

    ms 200ms

  40. Little’s Law Server 2 requests = 10 rps * 200

    ms 200ms

  41. Little’s Law Server 2 requests = 10 rps * 200

    ms 200ms

  42. Little’s Law Server 2 requests = 10 rps * 200

    ms 200ms BEAM Processes

  43. Little’s Law Server 2 requests = 10 rps * 200

    ms 200ms BEAM Processes CPU Pressure

  44. Little’s Law Server 3 requests = 10 rps * 300

    ms 300ms BEAM Processes CPU Pressure

  45. Little’s Law Server 30 requests = 10 rps * 3000

    ms 3000ms BEAM Processes CPU Pressure

  46. Little’s Law Server 30 requests = 10 rps * ∞

    ms ∞ BEAM Processes CPU Pressure

  47. Little’s Law 30 requests = 10 rps * ∞ ms

  48. Little’s Law ∞ requests = 10 rps * ∞ ms

  49. Little’s Law ∞ requests = 10 rps * ∞ ms

    This is bad

  50. Lets Talk About… Queues Overload Mitigation Adaptive Concurrency

  51. Lets Talk About… Queues Overload Mitigation Adaptive Concurrency

  52. Overload Arrival Rate > Processing Time

  53. Overload Arrival Rate > Processing Time We need to get

    these under control

  54. Load Shedding Server Queue Server

  55. Load Shedding Server Queue Server Drop requests

  56. Load Shedding Server Queue Server Drop requests Stop sending

  57. Autoscaling

  58. Autoscaling

  59. Autoscaling Server DB Server

  60. Autoscaling Server DB Server Requests start queueing

  61. Autoscaling Server DB Server Server

  62. Autoscaling Server DB Server Server Now its worse

  63. Autoscaling needs to be in response to load shedding

  64. Circuit Breakers

  65. Circuit Breakers

  66. Circuit Breakers Server Server

  67. Circuit Breakers Server Server

  68. Circuit Breakers Server Server Shut off traffic

  69. Circuit Breakers Server Server

  70. Circuit Breakers Server Server I’m not quite dead yet

  71. Circuit Breakers are your last line of defense

  72. Lets Talk About… Queues Overload Mitigation Adaptive Concurrency

  73. Lets Talk About… Queues Overload Mitigation Adaptive Concurrency

  74. We want to allow as many requests as we can

    actually handle
  75. None

  76. Adaptive Limits Time Concurrency

  77. Adaptive Limits Actual limit Time Concurrency

  78. Adaptive Limits Actual limit Dynamic Discovery Time Concurrency

  79. Load Shedding Server Server

  80. Load Shedding Server Server Are we at the limit?

  81. Load Shedding Server Server Am I still healthy?

  82. Load Shedding Server Server

  83. Load Shedding Server Server Update Limits

  84. Adaptive Limits Time Concurrency Increased latency

  85. Latency Successful vs. Failed requests Signals for Adjusting Limits

  86. Additive Increase Multiplicative Decrease Success state: limit + 1 Backoff

    state: limit * 0.95 Time Concurrency

  87. Prior Art/Alternatives https://github.com/ferd/pobox/ https://github.com/fishcakez/sbroker/ https://github.com/heroku/canal_lock https://github.com/jlouis/safetyvalve https://github.com/jlouis/fuse

  88. Regulator https://github.com/keathley/regulator

  89. Regulator.install(:service, [ limit: {Regulator.Limit.AIMD, [timeout: 500]} ]) Regulator.ask(:service, fn ->

    {:ok, Finch.request(:get, "https://keathley.io")} end) Regulator

  90. Conclusion

  91. Queues are everywhere

  92. Those queues need to be bounded to avoid overload

  93. If your system is dynamic, your solution will also need

    to be dynamic

  94. Go and build awesome stuff

  95. Thanks Chris Keathley / @ChrisKeathley / c@keathley.io