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
| ||
|
Date: Fri, 9 May 2014 11:53:24 +0200
From: Peter Zijlstra <peterz@...radead.org>
To: riel@...hat.com
Cc: linux-kernel@...r.kernel.org, mingo@...nel.org, mgorman@...e.de,
chegu_vinod@...com
Subject: Re: [PATCH 2/4] sched,numa: weigh nearby nodes for task placement on
complex NUMA topologies
On Thu, May 08, 2014 at 01:23:29PM -0400, riel@...hat.com wrote:
> + /*
> + * For nodes with distances in-between LOCAL_DISTANCE
> + * and max_distance, we count the faults on those nodes
> + * in proportion to their distance, using this formula:
> + *
> + * max_distance - node_distance
> + * -----------------------------
> + * max_distance - LOCAL_DISTANCE
> + */
> + if (task)
> + faults = task_faults(p, node);
> + else
> + faults = group_faults(p, node);
> +
> + score += 1000 * faults *
> + (max_distance - distance) /
> + (max_distance - LOCAL_DISTANCE);
OK that makes sense, except I would suggest you use a power-of-two scale
factor :-)
Content of type "application/pgp-signature" skipped
Powered by blists - more mailing lists