Messages in this thread | | | Date | Tue, 7 Dec 1999 09:43:43 -0200 | From | Ralf Baechle <> | Subject | Re: AVL trees vs. Red-Black trees |
| |
On Mon, Nov 29, 1999 at 07:43:13PM +0100, Jamie Lokier wrote:
> And of course, are the rules for non-Intel "x86 compatible" processors > just as strong?
They are, at least for everything that can (could ...) run Windows NT for which strong ordering is a requirement. This only covers ordering for cached memory accesses; ordering between cached and uncached accesses or uncached accesses is no generally strongly ordered and even for cached memory optionally more liberal ordering may be available as an option.
Ralf
- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.rutgers.edu Please read the FAQ at http://www.tux.org/lkml/
| |