Re: Phase tree algorithm defined

From: Andi Kleen (ak@suse.de)
Date: Thu Oct 05 2000 - 10:08:45 EST


On Thu, Oct 05, 2000 at 03:46:10PM +0100, richardj_moore@uk.ibm.com wrote:
>
>
> Good! I hope to meet you next week at ALS as I'm giving a pitch on DProbes
> next Thursday. When is your session?

I'm using it successfully after a quick port to 2.4. Very nice work.

>
> The P-tree by the way is described by Knuth but was modiifed slightly when
> deployed in HPFS. There are some details of it around - see If I still
> have any unclassified info - actually come to think of it I might be
> confusing the in-memory representation of the file system with what's on
> disk - my memory is getting dim when I comes to OS2.

As far as I can see (from reading fs/hpfs/*) HPFS uses a btree (or perhaps
b*tree) on disk.

-Andi
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
Please read the FAQ at http://www.tux.org/lkml/



This archive was generated by hypermail 2b29 : Sat Oct 07 2000 - 21:00:16 EST