On Mon, Mar 02, 2020 at 10:24:51AM -0500, Rafael Aquini wrote:
[...]
> I'm testing these changes against RHEL integration + regression
> tests, and I'll also run them against a specially crafted test
> to measure the impact on task-switching, if any. (I'll report back,
> soon)
>
As promised, I ran the the patches against a full round of kernel
integration/regression tests (the same we use to run for RHEL kernels)
unfortunately, there is no easy way to share these internal results,
but apart from a couple warnings -- which were not related to the test
build -- everything went on very smoothly with the patches on top of
a RHEL-8 test-kernel.
I grabbed some perf numbers, to serve as kernel build benchmark.
Test system is a 1 socket 32 core 3.3Ghz ARMv8 Ampere eMAG 256GB RAM.
rpmbuild spawns the build with make -j32 and besides the stock kernel RPM,
it also builds the -debug flavor RPM and all the sub-RPMs for tools and
extra modules.
* stock RHEL-8 build:
Performance counter stats for 'rpmbuild --rebuild kernel-4.18.0-184.el8.aatlb.src.rpm':
27,817,487.14 msec task-clock # 15.015 CPUs utilized
1,318,586 context-switches # 0.047 K/sec
515,342 cpu-migrations # 0.019 K/sec
68,513,346 page-faults # 0.002 M/sec
91,713,983,302,759 cycles # 3.297 GHz
49,871,167,452,081 instructions # 0.54 insn per cycle
23,801,939,026,338 cache-references # 855.647 M/sec
568,847,557,178 cache-misses # 2.390 % of all cache refs
145,305,286,469 dTLB-loads # 5.224 M/sec
752,451,698 dTLB-load-misses # 0.52% of all dTLB cache hits
1852.656905157 seconds time elapsed
26866.849105000 seconds user
965.756120000 seconds sys
* RHEL8 kernel + Andrea's patches:
Performance counter stats for 'rpmbuild --rebuild kernel-4.18.0-184.el8.aatlb.src.rpm':
27,713,883.25 msec task-clock # 15.137 CPUs utilized
1,310,196 context-switches # 0.047 K/sec
511,909 cpu-migrations # 0.018 K/sec
68,535,178 page-faults # 0.002 M/sec
91,412,320,904,990 cycles # 3.298 GHz
49,844,016,063,738 instructions # 0.55 insn per cycle
23,795,774,331,203 cache-references # 858.623 M/sec
568,445,037,308 cache-misses # 2.389 % of all cache refs
135,868,301,669 dTLB-loads # 4.903 M/sec
746,267,581 dTLB-load-misses # 0.55% of all dTLB cache hits
1830.813507976 seconds time elapsed
26785.529337000 seconds user
943.251641000 seconds sys
I also wanted to measure the impact of the increased amount of code in
the task switching path (in order to decide which TLB invalidation
scheme to pick), to figure out what would be the worst case scenario
for single threads of execution constrained into one core and yelding
the CPU to each other. I wrote the small test (attached) and grabbed
some numbers in the same box, for the sake of comparison:
* stock RHEL-8 build:
Performance counter stats for './tlb-test' (1000 runs):
122.67 msec task-clock # 0.997 CPUs utilized ( +- 0.04% )
32,297 context-switches # 0.263 M/sec ( +- 0.00% )
0 cpu-migrations # 0.000 K/sec
325 page-faults # 0.003 M/sec ( +- 0.01% )
404,648,928 cycles # 3.299 GHz ( +- 0.04% )
239,856,265 instructions # 0.59 insn per cycle ( +- 0.00% )
121,189,080 cache-references # 987.964 M/sec ( +- 0.00% )
3,414,396 cache-misses # 2.817 % of all cache refs ( +- 0.05% )
2,820,754 dTLB-loads # 22.996 M/sec ( +- 0.04% )
34,545 dTLB-load-misses # 1.22% of all dTLB cache hits ( +- 6.16% )
0.1230361 +- 0.0000435 seconds time elapsed ( +- 0.04% )
* RHEL8 kernel + Andrea's patches:
Performance counter stats for './tlb-test' (1000 runs):
125.57 msec task-clock # 0.997 CPUs utilized ( +- 0.05% )
32,244 context-switches # 0.257 M/sec ( +- 0.01% )
0 cpu-migrations # 0.000 K/sec
325 page-faults # 0.003 M/sec ( +- 0.01% )
413,692,492 cycles # 3.295 GHz ( +- 0.04% )
241,017,764 instructions # 0.58 insn per cycle ( +- 0.00% )
121,155,050 cache-references # 964.856 M/sec ( +- 0.00% )
3,512,035 cache-misses # 2.899 % of all cache refs ( +- 0.04% )
2,912,475 dTLB-loads # 23.194 M/sec ( +- 0.02% )
45,340 dTLB-load-misses # 1.56% of all dTLB cache hits ( +- 5.07% )
0.1259462 +- 0.0000634 seconds time elapsed ( +- 0.05% )
AFAICS, the aforementioned benchmark numbers are suggesting that there is,
virtually, no considerable impact, or very minimal and no detrimental impact
to ordinary workloads imposed by the changes, and Andrea's benchmarks are
showing/suggesting that a broad range of particular workloads will considerably
benefit from the changes.
With the numbers above, added to what I've seen in our (internal)
integration tests, I'm confident on the stability of the changes.
-- Rafael
// SPDX-License-Identifier: BSD-2-Clause
/*
* Copyright (c) 2020, Rafael Aquini <aquini@xxxxxxxxxx>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* compile with: gcc -o tlb-test -D_GNU_SOURCE -lpthread tlb-test.c
* dependencies:
* - _GNU_SOURCE required for asprintf(3), sched_getcpu(3) && sched_setaffinity(2)
* - libpthreads required for POSIX semaphores
*/
#include <stdio.h>
#include <stdarg.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <fcntl.h>
#include <errno.h>
#include <sched.h>
#include <time.h>
#include <semaphore.h>
#include <sys/types.h>
#include <sys/times.h>
#include <sys/time.h>
#include <sys/stat.h>
#include <sys/wait.h>
#include <sys/mman.h>
#ifndef NCHILDS
#define NCHILDS 4
#endif
#ifndef NPAGES
#define NPAGES 32
#endif
#ifndef NRUNS
#define NRUNS 8192
#endif
#ifdef DEBUG
#define DPRINTF(...) fprintf(stderr, __VA_ARGS__)
#else
#define DPRINTF(...)
#endif
#define ERROR_EXIT(msg) \
do { \
char *estr = NULL; \
asprintf(&estr, "[%s:%d] %s", __FILE__, __LINE__, msg); \
perror(estr); \
exit(EXIT_FAILURE); \
} while (0)
static const char *prg_name = "tlb-test";
static long system_hz;
static long page_size;
static sem_t *sem;
/*
* Fisher-Yates shuffler algorithm [Statistical Tables (London, 1938), Ex.12],
* adapted to computer language by R. Durstenfeld [CACM 7 (1964), 420], and
* presented by Donald E. Knuth at:
* "The Art of Computer Programming, Volume 2: Seminumerical Algorithms"
* [Algorithm P (shuffling) under Section 3.4 OTHER TYPES OF RANDOM QUANTITIES]
*/
void fy_shuffler(unsigned long *buf, unsigned long len)
{
unsigned long j, u, tmp;
for (j = len - 1; j > 0; j--) {
u = rand() % j;
tmp = *(buf + u);
*(buf + u) = *(buf + j);
*(buf + j) = tmp;
}
}
unsigned long usec_diff(struct timeval *a, struct timeval *b)
{
unsigned long usec;
usec = (b->tv_sec - a->tv_sec) * 1000000;
usec += b->tv_usec - a->tv_usec;
return usec;
}
unsigned long workload(void *addr, size_t len, unsigned long *fault_order, int child)
{
struct timeval start, end;
unsigned long i;
gettimeofday(&start, NULL);
for (i = 0; i < len; i++) {
unsigned long p = *(fault_order + i);
*((unsigned char *)(addr + (p * page_size))) = ((i * p) % 0xff);
}
gettimeofday(&end, NULL);
DPRINTF("[%s: child-%d (CPU=%d PID=%ld)] RUNNING! \n",
prg_name, child, sched_getcpu(), (long) getpid());
return usec_diff(&start, &end);
}
int child(int n, FILE *stream)
{
unsigned long pages[NPAGES];
size_t map_sz;
int i, runs;
void *addr;
double elapsed = 0;
for (i = 0; i < NPAGES; i++)
pages[i] = i;
map_sz = page_size * NPAGES;
addr = mmap(NULL, map_sz, PROT_READ | PROT_WRITE,
MAP_ANONYMOUS | MAP_PRIVATE, -1, 0);
if (addr == MAP_FAILED)
ERROR_EXIT("mmap");
if (madvise(addr, map_sz, MADV_NOHUGEPAGE) == -1)
ERROR_EXIT("madvise");
srand(time(NULL));
for (runs = 0; runs < NRUNS; runs++) {
sem_wait(sem);
elapsed += workload(addr, NPAGES, pages, n);
fy_shuffler(pages, NPAGES);
sem_post(sem);
/*
* relinquish the CPU to provide a small backoff, so other tasks
* get a fair chance on aquiring the semaphore.
*/
sched_yield();
}
fprintf(stream, "[%s: child-%d (CPU=%d PID=%ld)] %lf msecs\n",
prg_name, n, sched_getcpu(), (long) getpid(), (double )(elapsed / 1000));
return 0;
}
int main(int argc, char *argv[])
{
pid_t pid[NCHILDS];
int i, ret, status;
cpu_set_t set;
CPU_ZERO(&set); /* clear the set */
CPU_SET(1, &set);
if (sched_setaffinity(0, sizeof(cpu_set_t), &set) == -1)
ERROR_EXIT("sched_setaffinity");
if ((system_hz = sysconf(_SC_CLK_TCK)) == -1)
ERROR_EXIT("sysconf");
if ((page_size = sysconf(_SC_PAGESIZE)) == -1)
ERROR_EXIT("sysconf");
sem = sem_open(prg_name, O_CREAT, S_IRUSR | S_IWUSR, 0);
if (sem == SEM_FAILED)
ERROR_EXIT("sem_open");
for (i = 0; i < NCHILDS; i++) {
pid[i] = fork();
switch (pid[i]) {
case -1: /* fork() has failed */
ERROR_EXIT("fork");
break;
case 0: /* child of a sucessful fork() */
ret = child(i+1, stdout);
exit(ret);
break;
}
}
sem_post(sem);
for (;;) {
if (wait(&status) == -1) {
if (errno == ECHILD) {
goto out;
} else {
ERROR_EXIT("wait");
}
}
}
out:
sem_close(sem);
sem_unlink(prg_name);
exit(EXIT_SUCCESS);
}
