Messages in this thread | | | Date | Sun, 23 Feb 2003 22:41:28 -0800 | From | William Lee Irwin III <> | Subject | Re: Minutes from Feb 21 LSE Call |
| |
On Sun, Feb 23, 2003 at 06:57:09PM -0500, Bill Davidsen wrote: >> Clearly. And things which require more locking will pay some penalty for >> this. But a quick scan of this list on keyword "lockless' will show that >> people are thinking about this.
On Sun, Feb 23, 2003 at 11:22:30PM -0700, Val Henson wrote: > Lockless algorithms still generate bus traffic when you do the atomic > compare-and-swap or load-linked or whatever hardware instruction you > use to implement your lockless algorithm. Caches still have to stay > coherent, lock or no lock.
Not all lockless algorithms operate on the "access everything with atomic operations" principle. RCU, for example, uses no atomic operations on the read side, which is actually fewer atomic operations than standard rwlocks use for the read side.
-- wli - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |