lkml.org 
[lkml]   [1999]   [Feb]   [10]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: Real Time scheduler?
On Wed, Feb 10, 1999 at 05:39:43AM -0700, Victor Yodaiken wrote:
> > The solution is PRIORITY INVERSION: If a high prio process is waiting for
> > something a low prio porcess provides, the low prio process should
> > temporarily get the high prio.
>
> You mean "PRIORITY INHERITANCE"

Yes, of course. I'm sure, I wrote it down correctly, but to clear things, I
typed them in capitals. Obviously wrong. Arghh !

> ...
>
> And then consider how a kernel that depends on the operation of many daemon
> processes will continue to operate when users can introduce arbitrarily many
> "RT" processes that can block daemons indefinitely.

RT processes make absolutely no sense, when there are many of them.
Maybe, only one or two or NUM_CPU should be allowed at the same time.

--
Kurt Garloff <kurt@garloff.de> [Dortmund, FRG]
Plasma physics, high perf. computing [Linux-ix86,-axp, DUX]
PGP key: see mailheader [Linux SCSI driver: DC390]
[unhandled content-type:application/pgp-signature]
\
 
 \ /
  Last update: 2005-03-22 13:50    [from the cache]
©2003-2011 Jasper Spaans