Zswap Could See Better Performance Thanks To A B-Tree Search Implementation
Written by Michael Larabel in Linux Kernel on 18 November 2019 at 12:26 AM EST. 11 Comments
For those using Zswap as a compressed RAM cache for swapping on Linux systems, the performance could soon see a measurable improvement.

Developer Vitaly Wool has posted a patch that switches the Zswap code from using red-black trees to a B-tree for searching. Particularly for when having to search a large number of entries, the B-trees implementation should do so much more efficiently.

Results shared by Wool show more than a 5.3x improvement in bogo/ops with the B-Tree patch. It's possible the performance could be even better as Vitaly argues the existing kernel B-Tree implementation isn't the most efficient.

More details on this Zswap proposal for the Linux kernel via the kernel mailing list.
Related News
About The Author
Author picture

Michael Larabel is the principal author of Phoronix.com and founded the site in 2004 with a focus on enriching the Linux hardware experience. Michael has written more than 20,000 articles covering the state of Linux hardware support, Linux performance, graphics drivers, and other topics. Michael is also the lead developer of the Phoronix Test Suite, Phoromatic, and OpenBenchmarking.org automated benchmarking software. He can be followed via Twitter or contacted via MichaelLarabel.com.

Popular News This Week