On Mon, Jan 22, 2007 at 06:06:53PM -0600, John Stanton wrote:
> Alternately use a 64 bit machine and a 64 bit OS.
Did you not read what I wrote? That was one of the solutions I offered.
The issue is that memory mapping runs into the 32-bit VM space wall and
you have three options: too bad, go 64-
Nicolas Williams wrote:
On Mon, Jan 22, 2007 at 05:13:44PM -0600, John Stanton wrote:
Of course. The point is that 32-bit memory models will impact the
design of the this pager. Either only support 64-bit memory models,
window your memory mappings, or only support small databases.
Or be ad
On Mon, Jan 22, 2007 at 05:13:44PM -0600, John Stanton wrote:
> >Of course. The point is that 32-bit memory models will impact the
> >design of the this pager. Either only support 64-bit memory models,
> >window your memory mappings, or only support small databases.
> >
> Or be adaptive and sense
Nicolas Williams wrote:
On Mon, Jan 22, 2007 at 03:05:12PM -0600, John Stanton wrote:
Certainly, but the requirement here is for an in-memory fs, as I read
the email.
Of course. The point is that 32-bit memory models will impact the
design of the this pager. Either only support 64-bit memo
On Mon, Jan 22, 2007 at 03:05:12PM -0600, John Stanton wrote:
> Certainly, but the requirement here is for an in-memory fs, as I read
> the email.
Of course. The point is that 32-bit memory models will impact the
design of the this pager. Either only support 64-bit memory models,
window your me
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
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
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
Here a Mini doc of what is a Pager for me.. or how I understand.. please
help me to understand better :D
thanks to all
http://pdbm.sourceforge.net/pager.html
On 18/01/07, John Stanton <[EMAIL PROTECTED]> wrote:
You may find that adding backward pointers will allow you to do
deletions better.
You may find that adding backward pointers will allow you to do
deletions better.
Cesar Rodas wrote:
project called, PDBM.
The project is DBM like project, with a B+tree, and key -> value data,
similar to BDB, QDBM or GDBM.
For that project I need implement a Pager system.
As I understand a
project called, PDBM.
The project is DBM like project, with a B+tree, and key -> value data,
similar to BDB, QDBM or GDBM.
For that project I need implement a Pager system.
As I understand a Page is the minimum IO block, and a Data could have more
than a Page but a Page just one Data.. Am I rig
11 matches
Mail list logo
