Re: AVL trees vs. Red-Black trees

Oliver Xymoron (
Tue, 30 Nov 1999 09:39:24 -0600 (CST)

On Tue, 30 Nov 1999, Andrea Arcangeli wrote:

> Each time you write code that runs SMP threaded you must insert the proper
> barriers and you must consider each case separately. That's why writing
> SMP threaded code is harder ;).

Of course. My point is that where you put the barriers depends on the
how strong the ordering model of the processor is. And since most of us
don't have data books for all the current CPUs, it would be helpful to
know what the lowest common denominator was. What is the weakest ordering
model the kernel will support?

 "Love the dolphins," she advised him. "Write by W.A.S.T.E.." 

- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to Please read the FAQ at