Building Adaptive Systems

06f8b41980eb4c577fa40c41d5030c19?s=47 Chris Keathley
May 28, 2020
Programming
15
530

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
450
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
5
790
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
4
680
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
0
180
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
0
51
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
0
240
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
0
120
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
2
220

Other Decks in Programming

See All in Programming
B54b5a57a1bfc0dfe592d61d2425a7e1?s=48 yuji_developer
0
150
70ae2d149767d4198aac83453481b8dd?s=48 amaotone
0
140
D1dd88d67a1b17b9d2ad981b75d205f3?s=48 myamashii
1
720
9eed44f137609e6ce3b6f1e14f80b9e1?s=48 izumin5210
6
3k
4a0e3afe85259f2973dbc9386b6a4bb3?s=48 ikumatadokoro
1
500
6648bd4390fba79c9baa6045e58fa337?s=48 bitone
2
150
933291444e456bfb511a66a2fa9c6929?s=48 j5ik2o
9
2.1k
1e90d209fa2f67b4f2bfd8106b93dbc6?s=48 tmizuma
12
4.2k
3f4e0340909015791f1712c52b116da7?s=48 tamadon
1
330
6c6b60f0440e030040a9141cab781ed0?s=48 hiboma
0
650
8ec2b967e38f000eb63ae345cd7c58e6?s=48 minodriven
38
5.5k
Dbab5e5a1fd54531e1119ede6b3b9e65?s=48 horie1024
0
100

Featured

See All Featured
D09fad3e36ae6841f54820be0e907f7a?s=48 rocio
155
11k
A0517b08532aec8ab2aae3f65d40ad86?s=48 hannesfritz
27
890
D83926c323d4f9289f947b4b4e76b939?s=48 jensimmons
205
10k
3d4519fd34b76fb265fc0237f3792bd4?s=48 danielanewman
197
19k
48c098b6579220a67a6ba949be6e4b5a?s=48 revolveconf
197
9.5k
A9704266587836f7e784235e5073b93e?s=48 jmmastey
5
380
C4de88ea47538e4594750e3861a341c8?s=48 brettharned
92
2.8k
91cefdf141106fa10674aae74ce05890?s=48 yeseniaperezcruz
297
31k
6bb82b13cda86d3b821fa44100335ddf?s=48 thoeni
3
370
Dafc4723e9a1c067796c0fec6f509774?s=48 lemiorhan
622
40k
465724d73fe3a92c0879fdfb43a3a6f3?s=48 philhawksworth
190
8.7k
D47656e20ff5e42f125fc5ea0fd636c6?s=48 tmm1
61
7.5k

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