Certainly, but the requirement here is for an in-memory fs, as I read the email.

Nicolas Williams wrote:
On Mon, Jan 22, 2007 at 09:59:56AM -0600, John Stanton wrote:

A neat way to implement a pager is to memory map a file to make it shared virtual memory. Then you need some form of mutex to synchronize access to it. If you are sharing it between processes or threads you need a lock flag on each page. If you make your shared area a named file rather than an anonymous space and write through it your cache can be persistent.

You may need a free list of deleted pages to avoid checkerboarding.

The benefit of the virtual memory approach is that you are not constrained by available memory and your application becomes more portable.


But you would be constrained by memory model (i.e., 32-bit is too
small), unless you move mmap windows about the file, which would be a
pain.

Nico


-----------------------------------------------------------------------------
To unsubscribe, send email to [EMAIL PROTECTED]
-----------------------------------------------------------------------------

Reply via email to