Re: Quick Fair Queue scheduler maturity and examples
From: Karel Rericha <hidden>
Date: 2011-10-27 12:46:08
2011/10/27 Eric Dumazet [off-list ref]:
Le jeudi 27 octobre 2011 à 13:30 +0200, Karel Rericha a écrit :quoted
Hi list, has anyone some experience about QFQ and its maturity ? I was not able to find anything more than patches and papers, real world examples and info are nonexistent.At its inclusion time (in linux 3.0), I did many tests and feedback to Stephen. By the way, QFQ is not only patches and papers, its now officially supported by linux netdev team ;) Unfortunately the machine where I kept traces of my qfq scripts was totally lost, no backups.... oh well... Given that not a single patch was added since initial commit, I guess nobody really uses the thing, or its perfect, who knows :) You definitely should be able to use it, and report here problems if any.
Actually I am doing some reseach to replace our main shaping machine with 60 000+ htb classes, which now saturates 12 core Xeon Westmere to 30% (there are five gigabit network ports on each interface affinited to cores). AFAIK QFQ should be O(1) complexity so it would bring saturation a requirements for number of cores down considerably (HTB has O(log(N)) complexity). I have test machine and about two months to decide if we will stay with HTB or we will try something else. So it would be VERY helpful, if you would search you memory instead your dead disk :-) and send me some example of QFQ usage, if I can ask for a little of your time. I promise to have results published here in return. Thanks, Karel BTW I can provide some virtual Gentoo servers for test setup if you would want participate in further testing.