lkml.org 
[lkml]   [1999]   [Apr]   [8]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: scheduling bottom halves/task queues
> [ actually there's a more recent paper on resource containers but i don't
> think it's been published yet ]

It's was in OSDI '99. You can find a copy at Druschel's web page:

http://www.cs.rice.edu/~druschel/

> > To sum up, he would like to have the bottom halves execute
> > in the context of the process that gave rise to their existence
> > (when such a process exists.) Matching up seems to be the
> > hard task here. Do you see any reasons this might be
> > easy/hard, doable/impossible, good idea/bad idea?

This seems complicated. How about having a kernel thread whose task it is
to run bottom half handlers? If it ran at the highest priority in the
system, then things would work more or less as they do now. However, it
could be preempted by RT threads of sufficiently high priority.

John

--
John Regehr | regehr@virginia.edu | http://www.cs.virginia.edu/~jdr8d/
grad student | Department of Computer Science | University of Virginia



-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu
Please read the FAQ at http://www.tux.org/lkml/

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