lkml.org 
[lkml]   [1997]   [Feb]   [20]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
From
SubjectRe: MiniProposal
Date
Theodore Y. Ts'o writes ...
>
> The algorithm which AIX uses is to choose the most recently started
> (non-root) process, presumably on the assumption that recently started
> processes have the least amount of CPU time invested, and the likelihood
> that the new process was the cause of the memory starvation.

If you've ever actually experienced this, the wisdom of doing so becomes
obvious. In such a situation, the whole system is typically thrashing
rather badly, so not much new or useful is getting started anyway (including
desparate attempts by people logged on to rectify the situation :-)).

Processes started after the troublemaker start dying, but there aren't many
of them and the troublemaker gets killed rather quickly on, and the system
returns to normal. The only problem with this method is if the process
causing the problem started a long time ago, and just recently started
misbehaving. Netscape has a way of doing that :-)

---------------------------------------------------------------------------
Tim Hollebeek | Disclaimer :=> Everything above is a true statement,
Electron Psychologist | for sufficiently false values of true.
Princeton University | email: tim@wfn-shop.princeton.edu
----------------------| http://wfn-shop.princeton.edu/~tim (NEW! IMPROVED!)
\
 
 \ /
  Last update: 2005-03-22 13:39    [W:0.105 / U:0.668 seconds]
©2003-2014 Jasper Spaans. Advertise on this site