Skip to contentSkip to conversation

: Scalable HFSC

PATCH In review Patrick McHardy 2 participants 2 messages Aug 14, 2004 – Aug 16, 2004

Subsystems (2)
lore
Share & tools
lore
#0 lore raw

cover : 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

#1 lore raw
Quoted 5 lines · On Sat, 14 Aug 2004 22:00:09 +0200 Patrick McHardy <[email protected]> wrote:

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.

All applied, thanks Patrick.