[PATCH 0/4]: Scalable HFSC

netdev

[PATCH 0/4]: Scalable HFSC

To:	"David S. Miller" <davem@xxxxxxxxxx>
Subject:	[PATCH 0/4]: Scalable HFSC
From:	Patrick McHardy <kaber@xxxxxxxxx>
Date:	Sat, 14 Aug 2004 22:00:09 +0200
Cc:	netdev@xxxxxxxxxxx, devik <devik@xxxxxx>, jamal <hadi@xxxxxxxxxx>
Sender:	netdev-bounce@xxxxxxxxxxx
User-agent:	Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.6) Gecko/20040413 Debian/1.6-5

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

[More with this subject...]

<Prev in Thread]	Current Thread	[Next in Thread>
[PATCH 0/4]: Scalable HFSC, Patrick McHardy <= Re: [PATCH 0/4]: Scalable HFSC, David S. Miller

Previous by Date:	Re: [ESP] Only one algorithm is required, Herbert Xu
Next by Date:	[PATCH 2.6 1/4]: Add rb_last(), Patrick McHardy
Previous by Thread:	Deleting incoming network packets / sk_buff, Michael Renzmann
Next by Thread:	Re: [PATCH 0/4]: Scalable HFSC, David S. Miller
Indexes:	[Date] [Thread] [Top] [All Lists]