Remove c
article thumbnail

Analyzing a High Rate of Paging

Brendan Gregg

A service team was debugging a performance issue and noticed it coincided with a high rate of paging. I was asked to help, and used a variety of performance tools to solve this including those that use eBPF and Ftrace. Reads usually have apps waiting on them; writes may not (write-back caching). Hit Ctrl-C to end. ^C

Cache 105
article thumbnail

How To Add eBPF Observability To Your Product

Brendan Gregg

cachestat File system cache statistics line charts. I chose these to find the most performance wins with the fewest tools. Then, having discovered everything is C or Python, some rewrite it all in a different language. execsnoop New processes (via exec(2)) table. opensnoop Files opened table. BPF up and running! at the time.

Latency 145
Insiders

Sign Up for our Newsletter

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Trending Sources

article thumbnail

Analyzing a High Rate of Paging

Brendan Gregg

A service team was debugging a performance issue and noticed it coincided with a high rate of paging. I was asked to help, and used a variety of Linux performance tools to solve this including those that use eBPF and Ftrace. 100.00 ^C I'm looking at the r_await column in particular: the average wait time for reads in milliseconds.

Cache 40
article thumbnail

Speeding up Linux kernel builds with ccache

Nick Desaulniers

ccache , the compiler cache, is a fantastic way to speed up build times for C and C++ code that I previously recommended. Usually when this happens with ccache, there’s something non-deterministic about the builds that prevents cache hits. Cold Cache. kB max cache size 5.0 kB max cache size 5.0

Speed 46
article thumbnail

Three Other Models of Computer System Performance: Part 1

ACM Sigarch

Existing systems can be studied with measurement, while prospective systems are most often studied by extrapolating from measurements of prior systems or via simulation software that mimics target system function and provides performance metrics. Can one both minimize latency and maximize throughput for unscheduled work? Answered in Part 2.).

Systems 60
article thumbnail

Three Other Models of Computer System Performance: Part 2

ACM Sigarch

The M/M/1 queue will show us a required trade-off among (a) allowing unscheduled task arrivals, (b) minimizing latency, and (c) maximizing throughput. For the previous cache miss buffer example, the 32-buffer answer is minimal for 100-ns average miss latency. While Little’s Law provides a black-box result, it does not expose tradeoffs.

Systems 53
article thumbnail

MariaDB vs MySQL: Key Differences and Use Cases

Percona

Critical features of MariaDB include robust security features like encryption at rest and in transit, user authentication, and role-based access control (RBAC), as well as high-performance query execution, advanced indexing techniques, and replication, clustering, and sharding, ensuring scalability and high availability. What is MySQL?