🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: comp.arch
Article #2125

Re: Memory utilization & inter-process contention

#2125
From: Piercarlo Grandi
Date: Wed, 06 Sep 1989 13:06
55 lines
2752 bytes
In article <PCG.89Sep2220027@thor.cs.aber.ac.uk>
pcg@thor.cs.aber.ac.uk (Piercarlo Grandi) writes:

   A very interesting, forgotten article by Dijkstra argues for
   essentially what is essentially pff.

My reference and article archive/database is still in a state of
disarray.  I cannot find the book where this paper was.
It was published by Springer Verlag in the their LNCS series, and
it was part of the proceedings of an OS course in the seventies,
probably a NATO one.

   There are shortcuts. A paper I remember on SIGOPS detailed the
   design of the Univac 80 (IBM lookalike, ex RCA) ws pager. It
   tried hard to minimize such overheads, and to provide an
   efficient proxy to the true ws rule of time based victim
   selection. Seemed well done. Another interesting (old as well) paper
   seems to be that describing the VM ws pager done at Grenoble.

The Univac paper is

	Marc H. Fogel "The VMOS paging algorithm: a practical
	implementation of the working set model", ACM SIGOPS, Jan 1974.

The VM paper is

	Juan Rodriguez-Rosell, Jean-Pierre Dupuy "The design,
	implementation, and evaluation of a working set dispatcher",
	CACM, Apr 1973.

The paper that compares pff and ws is:

	Ram K. Gupta, Mark A. Franklin "Working set and page fault
	frequency algorithms: a performance comparison", IEEE TC,
	Aug 1978.

Other interesting policies are thos described in:

	Alan J. Smith "A modified working set paging algorithm",
	IEEE TC, Sep 1976.

	Richard W. Carr, John L. Hennessy "WSClock - a simple and
	effective algorithm for virtual memory management", ACM SIGOPS 1981.

	Domenico Ferrari "VSWS: the variable interval sample working set
	policy", IEEE TSE, May 1983.

Hope this helps. I think that the Gupta paper is extremely interesting
reading, and so are the two on actual working set simulations. VSWS seems
also nice.
--
Piercarlo "Peter" Grandi           | ARPA: pcg%cs.aber.ac.uk@nsfnet-relay.ac.uk
Dept of CS, UCW Aberystwyth        | UUCP: ...!mcvax!ukc!aber-cs!pcg
Penglais, Aberystwyth SY23 3BZ, UK | INET: pcg@cs.aber.ac.uk
Technical Details
Message-ID: <PCG.89Sep6140609@thor.cs.aber.ac.uk>
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!wuarchive!wugate!uunet!mcsun!ukc!edcastle!dcl-cs!aber-cs!thor!pcg
References: <3332@blake.acs.washington.edu> <261500008@S34.Prime.COM> <2389@auspex.auspex.com> <3398@cbnewsh.ATT.COM> <PCG.89Sep2220027@thor.cs.aber.ac.uk>

Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!wuarchive!wugate!uunet!mcsun!ukc!edcastle!dcl-cs!aber-cs!thor!pcg
From: pcg@thor.cs.aber.ac.uk (Piercarlo Grandi)
Newsgroups: comp.arch
Subject: Re: Memory utilization & inter-process contention
Message-ID: <PCG.89Sep6140609@thor.cs.aber.ac.uk>
Date: 6 Sep 89 13:06:09 GMT
References: <3332@blake.acs.washington.edu> <261500008@S34.Prime.COM>
 <2389@auspex.auspex.com> <3398@cbnewsh.ATT.COM>
 <PCG.89Sep2220027@thor.cs.aber.ac.uk>
Sender: pcg@aber-cs.UUCP
Organization: Coleg Prifysgol Cymru
Lines: 55
In-reply-to: pcg@thor.cs.aber.ac.uk's message of 2 Sep 89 21:00:27 GMT