[<prev] [next>] [thread-next>] [day] [month] [year] [list]
Message-ID: <alpine.LNX.2.20.13.2006042341160.3984@monopod.intra.ispras.ru>
Date: Fri, 5 Jun 2020 00:29:23 +0300 (MSK)
From: Alexander Monakov <amonakov@...ras.ru>
To: linux-kernel@...r.kernel.org
cc: "Rafael J. Wysocki" <rafael.j.wysocki@...el.com>
Subject: schedutil issue with serial workloads
Hello,
this is a question/bugreport about behavior of schedutil on serial workloads
such as rsync, or './configure', or 'make install'. These workloads are
such that there's no single task that takes a substantial portion of CPU
time, but at any moment there's at least one runnable task, and overall
the workload is compute-bound. To run the workload efficiently, cpufreq
governor should select a high frequency.
Assume the system is idle except for the workload in question.
Sadly, schedutil will select the lowest frequency, unless the workload is
confined to one core with taskset (in which case it will select the
highest frequency, correctly though somewhat paradoxically).
This sounds like it should be a known problem, but I couldn't find any
mention of it in the documentation.
I was able to replicate the effect with a pair of 'ping-pong' programs
that get a token, burn some cycles to simulate work, and pass the token.
Thus, each program has 50% CPU utilization. To repeat my test:
gcc -O2 pingpong.c -o pingpong
mkfifo ping
mkfifo pong
taskset -c 0 ./pingpong 1000000 < ping > pong &
taskset -c 1 ./pingpong 1000000 < pong > ping &
echo > ping
#include <stdio.h>
#include <unistd.h>
int main(int argc, char *argv[])
{
unsigned i, n;
sscanf(argv[1], "%u", &n);
for (;;) {
char c;
read(0, &c, 1);
for (i = n; i; i--)
asm("" :: "r"(i));
write(1, &c, 1);
}
}
Alexander
Powered by blists - more mailing lists