lkml.org 
[lkml]   [2007]   [Sep]   [10]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
SubjectRe: [RFC 0/3] Recursive reclaim (on __PF_MEMALLOC)
From
Date
On Mon, 2007-09-10 at 12:41 -0700, Christoph Lameter wrote:
> On Mon, 10 Sep 2007, Peter Zijlstra wrote:
>
> > > Peter's approach establishes the
> > > limit by failing PF_MEMALLOC allocations.
> >
> > I'm not failing PF_MEMALLOC allocations. I'm more stringent in failing !
> > PF_MEMALLOC allocations.
>
> Right you are failing other allocations.
>
> > > If that occurs then other
> > > subsystems (like the disk, or even fork/exec or memory management
> > > allocation) will no longer operate since their allocations no longer
> > > succeed which will make the system even more fragile and may lead to
> > > subsequent failures.
> >
> > Failing allocations should never be a stability problem, we have the
> > fault-injection framework which allows allocations to fail randomly -
> > this should never crash the kernel - if it does its a BUG.
>
> Allright maybe you can get the kernel to be stable in the face of having
> no memory and debug all the fallback paths in the kernel when an OOM
> condition occurs.
>
> But system calls will fail? Like fork/exec? etc? There may be daemons
> running that are essential for the system to survive and that cannot
> easily take an OOM condition? Various reclaim paths also need memory and
> if the allocation fails then reclaim cannot continue.

I'm not making any of these paths significantly more likely to occur
than they already are. Lots and lots of users run swap heavy loads day
in day out - they don't get funny systems (well sometimes they do, and
theoretically we can easily run out of the PF_MEMALLOC reserves -
HOWEVER in practise it seems to work quite reliably).
[unhandled content-type:application/pgp-signature]
\
 
 \ /
  Last update: 2007-09-10 21:57    [from the cache]
©2003-2011 Jasper Spaans