[lkml]   [2003]   [Aug]   [17]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: Scheduler activations (IIRC) question
At 06:12 PM 8/17/2003 +0100, Jamie Lokier wrote:
>Mike Galbraith wrote:
> > >You may be wondering what happens when I do five stat() calls, all of
> > >which should be asynchronous (topical: to get the best out of the
> > >elevator).
> > >
> > >Nested? Not quite. At each stat() call that blocks for I/O, its
> > >shadow task becomes active; that creates its own shadow task (pulling
> > >a kernel task from userspace's cache of them), then continues to
> > >perform the next item of work, which is the next stat().
> > >
> > >The result is five kernel threads, each blocked on I/O inside a stat()
> > >call, exactly as desired. A sixth kernel thread, the only one running
> > >of my program, is continuing the work of the program.
> >
> > Oh. You just want to dispatch N syscalls from one entry to the kernel?
>No, not at all. I want to schedule cooperative state machines in
>userspace, in the classical select-loop style, but without idling the
>CPU when there's unpredictable blocking on disk I/O.
>The modern way is to use a few of worker threads per CPU, but they
>introduce latency problems and you still have to keep adapting the
>number of threads to the type of workload. (See my response to Nick
>Piggin and Ingo Oeser).
> > >Soon, each of the I/O bound threads unblocks, returns to userspace,
> > >stores its result, queues the next work of this state machine, adds
> > >this kernel task to userspace's cache, and goes to sleep.
> > >
> > >As you can see, this achieves asynchronous system calls which are too
> > >complex for aio(*), best use of the I/O elevator, and 100% CPU
> > >utilisation doing useful calculations.
> > >
> > >Other user/kernel scheduler couplings are possible, but what I'm
> > >describing doesn't ask for much(**). Just the right behaviour from
> > >the kernel's scheduling heuristic: namely, waker not preempted by
> > >wakee. Seems to be the way it's going anyway.
> >
> > If that's all you need, a SCHED_NOPREEMPT (synchronous wakeups) class
> > should do the trick. I thought you wanted a huge truckload more than that.
>Heh. It looks like that may not be needed, with Con's latest "wakee
>doesn't preempt waker" patch. That's why this thread is a followup to
>that one.

I think you'll need a truckload of something :) Maybe not the truckload of
nastiness I was imagining, but simply disabling preempt on wakeup ain't
gonna cut it. The synchronous wakeup I mentioned does that, it only marks
the freshly enqueued task as runnable, but there will be no preempt, no
priority recalculation, no migration, nada. However,...

>There are other efficiency concerns: sending SIGCONT and SIGSTOP
>before and after each potentially-blocking syscall is not the fastest
>thing in the world to do. Also it doesn't help with blocking due to
>vm paging, but that can be worked around in other ways.
>SCHED_NOPREMPT is not right even in principle. An active task wakes
>its shadow task, and the shadow task should not run unless the active
>task blocks before putting the shadow task back to sleep. The wakeup
>_is_ a synchronous wakeup, yet we don't want it to run shadow task to run.

...once the shadow task is enqueued and runnable, there's nothing to
prevent the worker thread from exhausting it's slice before it can put it's
shadow back to sleep. This, and the continue my slice in some other thread
thing is what made me think you'd have to deal with a schedule happening to
your worker thread with some kind of handler, and do all kinds of evil
things within... basically overloading the entire scheduler for that class.


To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
More majordomo info at
Please read the FAQ at

 \ /
  Last update: 2005-03-22 13:47    [W:0.077 / U:7.308 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site