From: Nick Piggin <nickpiggin@yahoo.com.au>
To: Andrew Morton <akpm@osdl.org>
Cc: linux-kernel@vger.kernel.org
Subject: [PATCH 2/13] improve pinned task handling
Date: Thu, 24 Feb 2005 18:16:55 +1100 [thread overview]
Message-ID: <1109229415.5177.68.camel@npiggin-nld.site> (raw)
In-Reply-To: <1109229362.5177.67.camel@npiggin-nld.site>
[-- Attachment #1: Type: text/plain, Size: 6 bytes --]
2/13
[-- Attachment #2: sched-lb-pinned.patch --]
[-- Type: text/x-patch, Size: 4342 bytes --]
John Hawkes explained the problem best:
A large number of processes that are pinned to a single CPU results
in every other CPU's load_balance() seeing this overloaded CPU as
"busiest", yet move_tasks() never finds a task to pull-migrate. This
condition occurs during module unload, but can also occur as a
denial-of-service using sys_sched_setaffinity(). Several hundred
CPUs performing this fruitless load_balance() will livelock on the
busiest CPU's runqueue lock. A smaller number of CPUs will livelock
if the pinned task count gets high.
Expanding slightly on John's patch, this one attempts to work out
whether the balancing failure has been due to too many tasks pinned
on the runqueue. This allows it to be basically invisible to the
regular blancing paths (ie. when there are no pinned tasks). We can
use this extra knowledge to shut down the balancing faster, and ensure
the migration threads don't start running which is another problem
observed in the wild.
Signed-off-by: Nick Piggin <nickpiggin@yahoo.com.au>
Index: linux-2.6/kernel/sched.c
===================================================================
--- linux-2.6.orig/kernel/sched.c 2005-02-24 17:31:27.042781371 +1100
+++ linux-2.6/kernel/sched.c 2005-02-24 17:43:39.180401105 +1100
@@ -1650,7 +1650,7 @@
*/
static inline
int can_migrate_task(task_t *p, runqueue_t *rq, int this_cpu,
- struct sched_domain *sd, enum idle_type idle)
+ struct sched_domain *sd, enum idle_type idle, int *pinned)
{
/*
* We do not migrate tasks that are:
@@ -1660,8 +1660,10 @@
*/
if (task_running(rq, p))
return 0;
- if (!cpu_isset(this_cpu, p->cpus_allowed))
+ if (!cpu_isset(this_cpu, p->cpus_allowed)) {
+ *pinned++;
return 0;
+ }
/*
* Aggressive migration if:
@@ -1687,11 +1689,11 @@
*/
static int move_tasks(runqueue_t *this_rq, int this_cpu, runqueue_t *busiest,
unsigned long max_nr_move, struct sched_domain *sd,
- enum idle_type idle)
+ enum idle_type idle, int *all_pinned)
{
prio_array_t *array, *dst_array;
struct list_head *head, *curr;
- int idx, pulled = 0;
+ int idx, pulled = 0, pinned = 0;
task_t *tmp;
if (max_nr_move <= 0 || busiest->nr_running <= 1)
@@ -1735,7 +1737,7 @@
curr = curr->prev;
- if (!can_migrate_task(tmp, busiest, this_cpu, sd, idle)) {
+ if (!can_migrate_task(tmp, busiest, this_cpu, sd, idle, &pinned)) {
if (curr != head)
goto skip_queue;
idx++;
@@ -1761,6 +1763,9 @@
goto skip_bitmap;
}
out:
+ *all_pinned = 0;
+ if (unlikely(pinned >= max_nr_move) && pulled == 0)
+ *all_pinned = 1;
return pulled;
}
@@ -1935,7 +1940,7 @@
struct sched_group *group;
runqueue_t *busiest;
unsigned long imbalance;
- int nr_moved;
+ int nr_moved, all_pinned;
spin_lock(&this_rq->lock);
schedstat_inc(sd, lb_cnt[idle]);
@@ -1974,9 +1979,14 @@
*/
double_lock_balance(this_rq, busiest);
nr_moved = move_tasks(this_rq, this_cpu, busiest,
- imbalance, sd, idle);
+ imbalance, sd, idle,
+ &all_pinned);
spin_unlock(&busiest->lock);
}
+ /* All tasks on this runqueue were pinned by CPU affinity */
+ if (unlikely(all_pinned))
+ goto out_balanced;
+
spin_unlock(&this_rq->lock);
if (!nr_moved) {
@@ -2041,7 +2051,7 @@
struct sched_group *group;
runqueue_t *busiest = NULL;
unsigned long imbalance;
- int nr_moved = 0;
+ int nr_moved = 0, all_pinned;
schedstat_inc(sd, lb_cnt[NEWLY_IDLE]);
group = find_busiest_group(sd, this_cpu, &imbalance, NEWLY_IDLE);
@@ -2061,7 +2071,7 @@
schedstat_add(sd, lb_imbalance[NEWLY_IDLE], imbalance);
nr_moved = move_tasks(this_rq, this_cpu, busiest,
- imbalance, sd, NEWLY_IDLE);
+ imbalance, sd, NEWLY_IDLE, &all_pinned);
if (!nr_moved)
schedstat_inc(sd, lb_failed[NEWLY_IDLE]);
@@ -2119,6 +2129,7 @@
cpu_group = sd->groups;
do {
for_each_cpu_mask(cpu, cpu_group->cpumask) {
+ int all_pinned;
if (busiest_rq->nr_running <= 1)
/* no more tasks left to move */
return;
@@ -2139,7 +2150,7 @@
/* move a task from busiest_rq to target_rq */
double_lock_balance(busiest_rq, target_rq);
if (move_tasks(target_rq, cpu, busiest_rq,
- 1, sd, SCHED_IDLE)) {
+ 1, sd, SCHED_IDLE, &all_pinned)) {
schedstat_inc(busiest_rq, alb_lost);
schedstat_inc(target_rq, alb_gained);
} else {
next prev parent reply other threads:[~2005-02-24 7:17 UTC|newest]
Thread overview: 38+ messages / expand[flat|nested] mbox.gz Atom feed top
2005-02-24 7:14 [PATCH 0/13] Multiprocessor CPU scheduler patches Nick Piggin
2005-02-24 7:16 ` [PATCH 1/13] timestamp fixes Nick Piggin
2005-02-24 7:16 ` Nick Piggin [this message]
2005-02-24 7:18 ` [PATCH 3/13] rework schedstats Nick Piggin
2005-02-24 7:19 ` [PATCH 4/13] find_busiest_group fixlets Nick Piggin
2005-02-24 7:20 ` [PATCH 5/13] find_busiest_group cleanup Nick Piggin
2005-02-24 7:21 ` [PATCH 6/13] no aggressive idle balancing Nick Piggin
2005-02-24 7:22 ` [PATCH 7/13] better active balancing heuristic Nick Piggin
2005-02-24 7:24 ` [PATCH 8/13] generalised CPU load averaging Nick Piggin
2005-02-24 7:25 ` [PATCH 9/13] less affine wakups Nick Piggin
2005-02-24 7:27 ` [PATCH 10/13] remove aggressive idle balancing Nick Piggin
2005-02-24 7:28 ` [PATCH 11/13] sched-domains aware balance-on-fork Nick Piggin
2005-02-24 7:28 ` [PATCH 12/13] schedstats additions for sched-balance-fork Nick Piggin
2005-02-24 7:30 ` [PATCH 13/13] basic tuning Nick Piggin
2005-02-24 8:46 ` [PATCH 12/13] schedstats additions for sched-balance-fork Ingo Molnar
2005-02-24 22:13 ` Nick Piggin
2005-02-25 11:07 ` Rick Lindsley
2005-02-25 11:21 ` Nick Piggin
2005-02-24 8:41 ` [PATCH 10/13] remove aggressive idle balancing Ingo Molnar
2005-02-24 12:13 ` Nick Piggin
2005-02-24 12:16 ` Ingo Molnar
2005-03-06 5:43 ` Siddha, Suresh B
2005-03-07 5:34 ` Nick Piggin
2005-03-07 8:04 ` Siddha, Suresh B
2005-03-07 8:28 ` Nick Piggin
2005-03-08 7:22 ` Siddha, Suresh B
2005-03-08 8:17 ` Nick Piggin
2005-03-08 19:36 ` Siddha, Suresh B
2005-02-24 8:39 ` [PATCH 7/13] better active balancing heuristic Ingo Molnar
2005-02-24 8:36 ` [PATCH 4/13] find_busiest_group fixlets Ingo Molnar
2005-02-24 8:07 ` [PATCH 3/13] rework schedstats Ingo Molnar
2005-02-25 10:50 ` Rick Lindsley
2005-02-25 11:10 ` Nick Piggin
2005-02-25 11:25 ` DHCP on multi homed host! Ravindra Nadgauda
2005-02-24 8:04 ` [PATCH 2/13] improve pinned task handling Ingo Molnar
2005-02-24 7:46 ` [PATCH 1/13] timestamp fixes Ingo Molnar
2005-02-24 7:56 ` Nick Piggin
2005-02-24 8:34 ` Ingo Molnar
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=1109229415.5177.68.camel@npiggin-nld.site \
--to=nickpiggin@yahoo.com.au \
--cc=akpm@osdl.org \
--cc=linux-kernel@vger.kernel.org \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox
all inboxes | Powered by JetHome®