,
3 tweets,
4 min read
Read on Twitter
EBTree is a very interesting data structure used in HAProxy. This talk goes into the design of EBTrees given the scheduling requirements of an event driven load balancer.
TIL the Linux scheduler used to use a linked list, before the red-black tree based CFS became the default.
TIL the Linux scheduler used to use a linked list, before the red-black tree based CFS became the default.
Sorry couldn’t manage to live tweet this talk. I’m too engrossed in the talk to be tweeting.
It’s a really great talk on a very cool data structure. Here’s some pretty pictures #qcon
It’s a really great talk on a very cool data structure. Here’s some pretty pictures #qcon
HAProxy’s event loop and task schedule put together.
Keeping the timers and the run queue ordered is no small feat. The whole talk was about data structures in haproxy that make this happen.
Allows for 100ns inserts, > 250K TCP conn/second and >350K http conns/sec!! #qcon
Keeping the timers and the run queue ordered is no small feat. The whole talk was about data structures in haproxy that make this happen.
Allows for 100ns inserts, > 250K TCP conn/second and >350K http conns/sec!! #qcon
