Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!uwvax!husc6!panda!genrad!decvax!ittatc!dcdwest!sdcsvax!hutch
From: hutch@sdcsvax.UUCP (Jim Hutchison)
Newsgroups: net.arch
Subject: Re: VERY LARGE main memories
Message-ID: <2077@sdcsvax.UUCP>
Date: Tue, 16-Sep-86 11:58:40 EDT
Article-I.D.: sdcsvax.2077
Posted: Tue Sep 16 11:58:40 1986
Date-Received: Fri, 19-Sep-86 21:58:25 EDT
References: <1130@bu-cs.bu-cs.BU.EDU> <7144@lanl.ARPA> <7148@lanl.ARPA> <7094@utzoo.UUCP> <7331@lanl.ARPA>
Reply-To: hutch@sdcsvax.UUCP (Jim Hutchison)
Organization: UCSD EMU Project (Educational Microcomputer Unix)
Lines: 19

In article <7331@lanl.ARPA> jlg@a.UUCP (Jim Giles) writes:
>to come up with a good scheme.  The problem is that any scheme they DO come
>up with must work for general cases.  That is, it can't take advantage of
>special knowledge of a specific algorithm.
>
>The individual applications programmer CAN take advantage of such knowledge.

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.

-- 
    Jim Hutchison   UUCP:	{dcdwest,ucbvax}!sdcsvax!hutch
		    ARPA:	Hutch@sdcsvax.ucsd.edu
	"The fog crept in on little cats feet" -CS