[lkml]   [2001]   [Oct]   [13]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [Lse-tech] Re: RFC: patch to allow lock-free traversal of lists with insertion
In message <> you 
> (b) the whole notiong of "scheduling point" is a lot too fragile to be
> acceptable for important data structures. It breaks with the
> pre-emption patches on UP, and we've seen many times how hard it is
> for developers to notice even when there _is_ an explicit "end
> critical region now" kind of thing

Yeah, if you can't get locking right, you can't get RCU right. I've
shown you that using it in place of standard locking is simple: the
ONLY added issue is being careful not to screw readers while doing the
actual insert/delete.

Where, if anywhere, is this worth it? Good question: 3% on 4-way
dbench doesn't cut it in my book...

Premature optmztion is rt of all evl. --DK
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
More majordomo info at
Please read the FAQ at

 \ /
  Last update: 2005-03-22 13:08    [W:0.052 / U:0.072 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site