[lkml]   [1999]   [Dec]   [7]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: 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.


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

 \ /
  Last update: 2005-03-22 13:55    [from the cache]
©2003-2014 Jasper Spaans. hosted at Digital Ocean