Building Adaptive Systems

06f8b41980eb4c577fa40c41d5030c19?s=47 Chris Keathley
May 28, 2020
Programming
13
480

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
320
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
1
430
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
5
760
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
4
660
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
0
180
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
0
49
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
0
230
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
0
110
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
2
210

Other Decks in Programming

See All in Programming
A49edf2521f9e75826c6546c7585f17a?s=48 tsuyukimakoto
3
340
30682a28206e455a1bc57d7d85cd1e14?s=48 shomasegi
1
100
9f33218af7ae5c04e102fcc3076f2f5c?s=48 yhkaplan
3
110
Dcc589548f0372645aaeb95bda8e22c2?s=48 cpp
39
17k
15934fa2aa7b2ce21f091e9b7cffa856?s=48 manfredsteyer
2
360
913963fd6beff0a716f512efd3792065?s=48 hampen2929
1
600
575ca492bac55e895d0e1c86f7d709fe?s=48 hschwentner
9
1.6k
0ea7f61aec8fee539be0cf39b7bab77c?s=48 eregon
0
650
C5f6e8dffbb19acf405198c8fb917337?s=48 mp911de
1
130
Cc696ce673253d3bd21b3aa9e7927f39?s=48 hitode909
0
460
2661b52b92e28d73635638a17c96f4af?s=48 toversus
1
320
D65e990ab4df0d0a75c3b0ae5d036bc5?s=48 martinlippert
1
130

Featured

See All Featured
Fde6c3a50ca518a909ef35c22c0ee0e4?s=48 destraynor
144
19k
39488f9d172ab92fd352f2cd7b73258d?s=48 mza
80
3.9k
E76911cbe088e5b850d966de3fc7435b?s=48 robhawkes
52
2.7k
1519587b1a0febb658c36c94f6272b0d?s=48 roundedbygravity
241
20k
0bce06bd06ee7a2c4f5500f25dcf7f18?s=48 paulrobertlloyd
70
3.5k
Ecdea9b9714877b86cee08458f085481?s=48 trallard
9
370
3ab1249be442027903e1180025340b3f?s=48 reverentgeek
165
6.8k
C86443373fbfe92996aa882d0d7a59f8?s=48 imathis
478
150k
4394ceb8b277f35ee3da7030384efb5d?s=48 davidbonilla
68
3.4k
48c098b6579220a67a6ba949be6e4b5a?s=48 revolveconf
195
9.5k
9375a9529679f1b42b567a640d775e7d?s=48 schacon
144
6.5k
25c7c18223fb42a4c6ae1c8db6f50f9b?s=48 mojombo
356
62k

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