We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

Optimizing BPF hashmap and friends

Formal Metadata

Title
Optimizing BPF hashmap and friends
Title of Series
Number of Parts
542
Author
License
CC Attribution 2.0 Belgium:
You are free to use, adapt and copy, distribute and transmit the work or content in adapted or unchanged form for any legal purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
Identifiers
Publisher
Release Date
Language

Content Metadata

Subject Area
Genre
Abstract
The BPF Hashmap and other hash-based BPF maps including Stackmap and Bloom Filters use an old hash function, jhash. Therefore, this should not be difficult to improve the maps performance by using a better hash function. However, this is true only in the ideal world, i.e., when we load the Linux kernel with mitigations=off. This is not as straightforward in the real world. In this talk I will describe obstacles which appear in the real world and how to approach them. Also, I will talk about how to benchmark BPF maps and kernel code in general and look into how fast BPF maps are actually performing.