[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: |
Sat, 28 Jun 2008 10:50:57 +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 Sat, 28 Jun 2008 06:52:49 +0200,
<address@hidden> wrote:
>
> On Thu, Jun 26, 2008 at 03:24:59PM +0200, Neal H. Walfield wrote:
>
> > A.available = MAX (A.share + unused, A.allocated) * A.pressure
> >
> > (If unused is non-zero then pressure is 1)
>
> So when there is memory pressure in the system, then the "available"
> memory of a task drops below its "share"?...
Pressure is calculated locally. When an activity exceeds its share
and must yield some memory (as other activities want their share), its
pressure is increased (and A.pressure logically decreases). If
A.allocated < A.share, then A.pressure is 1.
A principal's share is dynamic. First, principals enter and exit the
system and this can affect an activity's share. Second, a
high-priority activity, by allocating memory, can decrease the share
of a low-priority activity.
- 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, 2008/06/26