---

Home Developer

KernelTrap: Making The BKL Preemptable

By

“Continuing his effort to minimize latency in the 2.6 kernel,
Ingo Molnar offered a patch to ‘get rid of Linux’s Big Kernel Lock
as we know it today.’ He explains that he does this by replacing
the BKL spinlock and depth counter with a special recursive
semaphore. Ingo goes on to explain three main advantages of this
approach; code utilizing the BKL is now fully preemptable, no time
is wasted spinning on the BKL if there’s BKL contention, and it is
believed to be fully backwards compatible.

“Linus Torvalds was not impressed saying, ‘I really think this
is wrong.’ He went to explain that he wasn’t against the concept,
but had some issues with the implemenation, and would be quite
interested in seeing performance numbers…”

Complete
Story

Get the Free Newsletter!

Subscribe to Developer Insider for top news, trends, & analysis

Must Read

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.

Our Brands

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.