Re: [9fans] Kernel panic when allocating a huge memory

[Charles Forsyth <charles.forsyth@gmail.com>]

[-- Attachment #1: Type: text/plain, Size: 944 bytes --]

local paging algorithms can avoid thrashing: "the process pages against
itself".
global paging algorithms typically do not (invariably do not, in my
experience, but most people use essentially the same one, so there might be
some that worked).

Wilkes has a nice discussion of paging algorithms as an application of
control theory
in "The Dynamics of Paging".
http://comjnl.oxfordjournals.org/content/16/1/4.short

"It is notorious that the use of apparently innocuous scheduling and paging
algorithms can give rise to the type of unstable behaviour known as
thrashing."


On 3 November 2012 17:57, erik quanstrom <quanstro@quanstro.net> wrote:

> other factors, like global knowledge of memory use stats and page
> duplication
> should put the vm in an even better position than general queueing theory
> would suggest to make decisions on what pages to move to disk wrt. global
> (that is total machine) throughput.
>

[-- Attachment #2: Type: text/html, Size: 1633 bytes --]