Upgrade to Pro — share decks privately, control downloads, hide ads and more …

Building Adaptive Systems

06f8b41980eb4c577fa40c41d5030c19?s=47 Chris Keathley
May 28, 2020
Programming
18
650

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
330
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
1
510
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
5
840
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
4
710
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
0
190
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
0
65
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
0
260
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
0
140
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
2
240

Other Decks in Programming

See All in Programming
5c588fdfe782f92fa6b081903edd82bb?s=48 hr01
1
1.3k
804bf3fd2baebf9a27e4774553688d37?s=48 saki4869
0
190
1c2b62114ede7d8cb897bf19b999d233?s=48 muttsu_623
0
540
8ad631306f5ab343446a967b98e64c0e?s=48 hollodotme
1
110
3331499a8c17bf14833f22b9173223f1?s=48 hanakla
2
3k
2102a6b8760bd6f57f672805723dd83a?s=48 line_developers_tw
1
490
1821636ac95415aa6e84bc33b394283d?s=48 tommykw
1
360
347a1b64f3a6e38981bc99b53919e2b1?s=48 azdaroth
0
140
8aebb410308ec2c655550798e92cd2df?s=48 ken3ypa
0
160
51105482dc2e3d01b3ba64c9751d75c6?s=48 showwin
0
130
Af9618883e81d7685d2b34e14f85ae1d?s=48 466548
0
140
72a2082c6a4dd79ad68befb3db911616?s=48 mraible
PRO
0
270

Featured

See All Featured
Dafc4723e9a1c067796c0fec6f509774?s=48 lemiorhan
627
43k
20bfe76b3d6105641f879fe45cfc9272?s=48 bkeepers
321
53k
B3d6434763caa0ef5dc4b792662c49f7?s=48 smashingmag
229
18k
20bfe76b3d6105641f879fe45cfc9272?s=48 bkeepers
52
4.1k
25c7c18223fb42a4c6ae1c8db6f50f9b?s=48 mojombo
358
62k
027d1ebf66cc039a0bd3b55eeadbe75d?s=48 sachag
267
17k
E76911cbe088e5b850d966de3fc7435b?s=48 robhawkes
52
2.8k
A60068bce2e73de3a37ca9d2dbe36092?s=48 bryan
100
11k
5f83ef806155b403c3393160ce51f955?s=48 jlugia
216
16k
C86443373fbfe92996aa882d0d7a59f8?s=48 imathis
478
150k
Aebc2d07a50011e2a30d38435fde564a?s=48 jrom
114
7.1k
F57e2136eb9895eb95ff5dc8a1c02677?s=48 zakiwarfel
88
3.3k

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