Brian Pane wrote:
> So the other alternative I've been thinking of is to > use an algorithm based on atomic compare-and-swap > operations to allow thread-safe searches and updates > of each hash chain. I've found several references > to lockless, concurrent linked list algorithms that > might be suitable, for example > http://citeseer.nj.nec.com/harris01pragmatic.html > I think that a thread-safe/lockless linked list would be of general use to people, maybe we can put it in apr-util? > Anybody have opinions on this? > > Thanks, > Brian > >
