Re: 'vectorized' (order-dependent) VM

Jamie Lokier (lkd@tantalophile.demon.co.uk)
Wed, 15 Jul 1998 14:19:59 +0100


> with such a 'vectorized' distribution free pages are not anymore randomly
> free pages, but implicitly depend on their physical address, so you cannot
> anymore do the above multiplication of independent probabilities to get
> the probability of a successful high-order allocation. If you do the
> maths, you get much nicer values for low memory systems. (actually, we get
> the numbers we _want_, with certain limitations, see below)

See my proposal on moving data once its in swap cache, in Re: Strange
interrupt behaviour.

With your metrics for good and bad places for single page allocations,
perhaps frequently used pages can percolate (without disk I/O) to good
places, improving the response time in trying to grab pages for larger
allocations.

-- Jamie

-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu
Please read the FAQ at http://www.altern.org/andrebalsa/doc/lkml-faq.html