[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Scheduling Memory in Viengoos
|
From: |
Neal H. Walfield |
|
Subject: |
Re: Scheduling Memory in Viengoos |
|
Date: |
Thu, 26 Jun 2008 15:24:59 +0200 |
|
User-agent: |
Wanderlust/2.14.0 (Africa) SEMI/1.14.6 (Maruoka) FLIM/1.14.8 (Shijō) APEL/10.6 Emacs/21.4 (i486-pc-linux-gnu) MULE/5.0 (SAKAKI) |
At Thu, 26 Jun 2008 12:59:08 +0200,
Neal H. Walfield wrote:
> Viengoos also provides a per-principal notion of availability. The
> very short version of how this is calculated is:
>
> A.available = MAX (A.share, A.allocated * A.pressure)
More precise is:
A.available = MAX (A.share + unused, A.allocated) * A.pressure
(If unused is non-zero then pressure is 1)
- Scheduling Memory in Viengoos, Neal H. Walfield, 2008/06/26
- Re: Scheduling Memory in Viengoos, Bas Wijnen, 2008/06/26
- on naming, Neal H. Walfield, 2008/06/26
- memory management, Neal H. Walfield, 2008/06/26
- using activities in a DoS attack vector, Neal H. Walfield, 2008/06/26
- Re: Scheduling Memory in Viengoos, Neal H. Walfield, 2008/06/26
- why programs behave nicely and protecting against those that don't, Neal H. Walfield, 2008/06/26
- Re: Scheduling Memory in Viengoos,
Neal H. Walfield <=