linux-kernel - Re: divide by zero bug in find_busiest

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Date:	Fri, 27 Aug 2010 10:13:30 +0200
From:	Peter Zijlstra <peterz@...radead.org>
To:	Chetan Ahuja <chetan.ahuja@...il.com>
Cc:	Venkatesh Pallipadi <venki@...gle.com>,
	linux-kernel@...r.kernel.org,
	Suresh Siddha <suresh.b.siddha@...el.com>
Subject: Re: divide by zero bug in find_busiest_group

On Fri, 2010-08-27 at 09:51 +0200, Peter Zijlstra wrote:
> 
> Load balancing works by balancing this group hierarchy, a number of
> groups are contained in a domain. Each cpu does a load-balance pull,
> from the busiest group in that domain to his local domain. 

s/local domain/local group/

> Since there's
> ever smaller groups/domains you eventually end up with a nicely spread
> load. 
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/