lkml.org 
[lkml]   [1998]   [Jan]   [23]   [last100]   RSS Feed
Views: [more markup]  [less markup]  [headers]  [forward] 
 
Messages in this thread
/
DateFri, 23 Jan 1998 04:10:04 -0500 (EST)
From"Albert D. Cahalan" <>
SubjectRe: Tree based scheduling
tytso@mit.edu writes:
> From: Rauli Ruohonen <raulir@fishy.pp.sci.fi>

>> If each user has his/her own node, they can set priorities of their
>> own processes as they wish: If they set one of their processes to
>> realtime priority, it has that priority only over other processes of
>> that user, not over processes of other users. 
>
> The flip side of this is that if a user renices a process, it will only
> make it have a lower priority than the user's other processes, not with
> respect to all of the processes in the system, which is what is usually
> desired when someone is renicing a process.

That is a feature, not a bug. Users can get their full
share of the CPU while not slowing down interactive tasks.

\
 
 \ /
  Last update: 2005-03-22 12:41    [W:2.705 / U:0.030 seconds]
©2003-2008 Jasper Spaans