Re: Phase tree algorithm defined
Andi Kleen wrote: > As far as I can see (from reading fs/hpfs/*) HPFS uses a btree (or perhaps > b*tree) on disk. For what: Directory? Data Index? Allocation Map? All of the above? -- Daniel - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to [EMAIL PROTECTED] Please read the FAQ at http://www.tux.org/lkml/
Re: Phase tree algorithm defined
On Thu, Oct 05, 2000 at 03:46:10PM +0100, [EMAIL PROTECTED] 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 [EMAIL PROTECTED] Please read the FAQ at http://www.tux.org/lkml/
Re: Phase tree algorithm defined
Daniel, This is very valuable - thanks for makeing the effort. You could enhance you document greatly if you provided a few diagrams to illustrate the structure, especially the example file system. I'd suggest converting the document to HTML or XML. Also, I'd like to understand how the Phase Tree differs from other tree schemes used by files systems, for example the Modified Patricia Tree used by HPFS and NTFS. It wasn't quite clear to me how the advantages of consistency are obtained, but diagrams might help. Richard Moore - RAS Project Lead - Linux Technology Centre (PISC). http://oss.software.ibm.com/developerworks/opensource/linux Office: (+44) (0)1962-817072, Mobile: (+44) (0)7768-298183 IBM UK Ltd, MP135 Galileo Centre, Hursley Park, Winchester, SO21 2JN, UK Daniel Phillips <[EMAIL PROTECTED]> on 05/10/2000 05:53:30 Please respond to Daniel Phillips <[EMAIL PROTECTED]> To: [EMAIL PROTECTED] cc:(bcc: Richard J Moore/UK/IBM) Subject: Phase tree algorithm defined I have finally produced something resembling a formal definition of the phase tree algorithm. As you will see, this algorithm is somewhat subtle, and not easy to express in clear simple terms. But I think that I have in fact expressed it clearly in simply. If I have not, I wish very much to be told so, and why. You can get a copy here: http://innominate.org/~phillips/tux2/phase.tree.algorithm.txt Please, if you are especially anal and nasty and have little regard for anyone's feelings, read this and complain about every little thing that is wrong with it, and I will greatly appreciate that. I will also appreciate comments of the form 'you left out this or that', or 'this part sounds like so much bafflegab' and so on. Enjoy. -- Daniel - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to [EMAIL PROTECTED] Please read the FAQ at http://www.tux.org/lkml/ - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to [EMAIL PROTECTED] Please read the FAQ at http://www.tux.org/lkml/
Re: Phase tree algorithm defined
Daniel, This is very valuable - thanks for makeing the effort. You could enhance you document greatly if you provided a few diagrams to illustrate the structure, especially the example file system. I'd suggest converting the document to HTML or XML. Also, I'd like to understand how the Phase Tree differs from other tree schemes used by files systems, for example the Modified Patricia Tree used by HPFS and NTFS. It wasn't quite clear to me how the advantages of consistency are obtained, but diagrams might help. Richard Moore - RAS Project Lead - Linux Technology Centre (PISC). http://oss.software.ibm.com/developerworks/opensource/linux Office: (+44) (0)1962-817072, Mobile: (+44) (0)7768-298183 IBM UK Ltd, MP135 Galileo Centre, Hursley Park, Winchester, SO21 2JN, UK Daniel Phillips [EMAIL PROTECTED] on 05/10/2000 05:53:30 Please respond to Daniel Phillips [EMAIL PROTECTED] To: [EMAIL PROTECTED] cc:(bcc: Richard J Moore/UK/IBM) Subject: Phase tree algorithm defined I have finally produced something resembling a formal definition of the phase tree algorithm. As you will see, this algorithm is somewhat subtle, and not easy to express in clear simple terms. But I think that I have in fact expressed it clearly in simply. If I have not, I wish very much to be told so, and why. You can get a copy here: http://innominate.org/~phillips/tux2/phase.tree.algorithm.txt Please, if you are especially anal and nasty and have little regard for anyone's feelings, read this and complain about every little thing that is wrong with it, and I will greatly appreciate that. I will also appreciate comments of the form 'you left out this or that', or 'this part sounds like so much bafflegab' and so on. Enjoy. -- Daniel - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to [EMAIL PROTECTED] Please read the FAQ at http://www.tux.org/lkml/ - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to [EMAIL PROTECTED] Please read the FAQ at http://www.tux.org/lkml/
Re: Phase tree algorithm defined
On Thu, Oct 05, 2000 at 03:46:10PM +0100, [EMAIL PROTECTED] 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 [EMAIL PROTECTED] Please read the FAQ at http://www.tux.org/lkml/
Re: Phase tree algorithm defined
Andi Kleen wrote: As far as I can see (from reading fs/hpfs/*) HPFS uses a btree (or perhaps b*tree) on disk. For what: Directory? Data Index? Allocation Map? All of the above? -- Daniel - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to [EMAIL PROTECTED] Please read the FAQ at http://www.tux.org/lkml/
