KernelTrap: Benchmarking the Lockless Pagecache | Linux Today

KernelTrap: Benchmarking the Lockless Pagecache

Written By
Web Webster
Web Webster
May 1, 2006

“Anticipatory I/O scheduler author Nick Piggin has been
maintaining a lockless pagecache patch for many months. In March he
provided a draft document that details the lockless radix-tree
utilized by the pagecache, in which it describes the Read-Copy
Update (RCU) algorithm used to share a dynamic data structure
without using locks. Jens Axboe recently posted some benchmark
results demonstrating some workloads that benefit from the lockless
pagecache…”

Complete Story

Web Webster

Web Webster

Web Webster has more than 20 years of writing and editorial experience in the tech sector. He’s written and edited news, demand generation, user-focused, and thought leadership content for business software solutions, consumer tech, and Linux Today, he edits and writes for a portfolio of tech industry news and analysis websites including webopedia.com, and DatabaseJournal.com.

Linux Today Logo

LinuxToday is a trusted, contributor-driven news resource supporting all types of Linux users. Our thriving international community engages with us through social media and frequent content contributions aimed at solving problems ranging from personal computing to enterprise-level IT operations. LinuxToday serves as a home for a community that struggles to find comparable information elsewhere on the web.

Property of TechnologyAdvice. © 2026 TechnologyAdvice. All Rights Reserved

Advertiser Disclosure: Some of the products that appear on this site are from companies from which TechnologyAdvice receives compensation. This compensation may impact how and where products appear on this site including, for example, the order in which they appear. TechnologyAdvice does not include all companies or all types of products available in the marketplace.