您的位置:首页 > 运维架构 > Linux

The Big Kernel Lock

2012-03-12 00:00 267 查看
http://lwn.net/Articles/281437/

BLK

==> semaphore

==> The semaphore is handled over to the new thread waiting for it. This introduces performance penalty --- the system's running idle almost 50% of the time.

==> lock stealing: A thread acquiring the semaphore could get it once the semaphore becomes available, regardless of whether or not the thread's at the head of the queue. However, this introduces bugs in some situation.

==> spin lock

==> makes the BKL non-preemptible. However, this sub-optimal BKL is currently the best solution for this trade-off problem.
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息