Skip to content

: Scalable HFSC

Patrick McHardy netdev 1 version In review

Get series with b4
b4 am [email protected]

Versions newest first

  1. v1 Latest4 patches 1 replyIn review

Patches in v1 No applies recorded yet

#Subject and filesSizeRepliesApplied
1/4: Add rb_last()lib/rbtree.c+13 -00 replies
1/4: Add rb_first/rb_last/rb_prev/rb_nextlib/rbtree.c+71 -00 replies
2/4: replace eligible list by rbtree+0 -00 replies
2/4: replace eligible list by rbtree+0 -00 replies
3/4: replace actlist by rbtrees+0 -00 replies
3/4: replace actlist by rbtrees+0 -00 replies
4/4: O(1) children vtoff adjustment+0 -00 replies
4/4: O(1) children vtoff adjustment+0 -00 replies

Reviews trailers per patch

No Reviewed-by, Acked-by or Tested-by trailers for v1 yet.

Read the v1 thread

Cover letter [PATCH 0/4]: Scalable HFSC

These 4 patches for 2.4/2.6 make HFSC more scalable by using rbtree's instead of sorted lists and an O(1) algorithm for adjusting childrens vt-offset. With these patches HFSC with 1024 active sibling classes performs only slightly worse (CPU-wise) than HTB. Each change has been well tested in tcsim, so I think nothing should break.

Regards
Patrick