"Juan J. Quintela" wrote:
>
> Daniel Phillips writes:
>
> > Phase tree is my terminology. In my previous post I failed to mention a much
> > bigger reason why phase tree is not shadow paging: phase tree does not use a
> > shadow page table. Instead, it uses a tree where the differences between one
> > commit phase and the next generate a minimal set of new nodes, and only these
> > need to be written to disk.
>
> If you have a good implementation of shadow paging, you are supposed
> to write to disk the minimun amount of data possible, i.e. only the
> things that have changed/are new. The method of writing the new data
> to free blocks and then change only the root is a known and used
> mechanism in shadow page implementations.
Perhaps you could point me to a description of such an implementation?
-- Daniel- 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/
This archive was generated by hypermail 2b29 : Mon Aug 07 2000 - 21:00:08 EST