🚀 go-pugleaf

In article <2077@sdcsvax.UUCP> hutch@sdcsvax.UUCP (Jim Hutchison) writes:
>...
>vmadvise() ???  I don't think BSD ever got it fully off of the ground, but
>it has interesting applications to you.  It was a way of sharing your
>specific paging knowledge which is bought by time, with the OS.  This will
>not save you from page translation cost, but it does allow you to advise
>the OS on differences your program has from the general case.  It also allows
>the OS to play any strange games that can be played to squeeze those extra
>pennies out of your XXXXX.
>
My document lists this as VADVISE().  It only has two settings which,
apparently, optimize for random order (that is, it ignores the recent
usage patterns), or it optimizes for the most frequently and recently
referenced pages (the default).  The MAN page contains a note that
this feature was included mainly to support LISP, which has fairly
random access patterns.

This doesn't seem to give the kind of control over memory contents that
I am used to.  It certainly doesn't seem likely to work well for an
algorithm that has some 'randomly' used data, some cyclically used data,
and some frequently used data (or some such mix).

The VADVISE() doc also mentions (under 'BUGS') that this 'Will go away
soon, being replaced by a per page *madvise* facility.' MADVISE looks
like it will have more control over memory contents (but still not
complete control).  It looks also like it will entail the same degree
of work to use it effectively as direct user control would require.
So the bottom line is: we still don't have complete control, we still
need to do a lot of work on our own, and we still have a slower memory
interface than necessary.

J. Giles
Los Alamos