Xref: utzoo comp.unix.wizards:24380 comp.unix.internals:2256
Path: utzoo!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!mips!pacbell.com!att!cbnews!cbnewsm!cbnewsl!kurt
From: kurt@cbnewsl.att.com (kurt.kovach)
Newsgroups: comp.unix.wizards,comp.unix.internals
Subject: Performance of two handed paging algorithm
Keywords: paging performance
Message-ID: <1991Mar7.140559.22529@cbnewsl.att.com>
Date: 7 Mar 91 14:05:59 GMT
Followup-To: poster
Organization: AT&T Bell Laboratories
Lines: 13


Has anyone done performance studies of the two-handed paging algorithm?

In particular there are a number of defined and calculated constants
like the distance between the hands, the values of lotsfree and
desfree, and a number of others.

I am interested in what people have found works the 'best' on different
architectures, different size memories, etc.


kurt kovach	krk@attunix.att.com
		...!attunix!krk