| |||||||||||||
An alternative approachAn alternative approachPosted Oct 13, 2009 22:25 UTC (Tue) by krasic (subscriber, #4782)Parent article: Deadline scheduling for Linux
Perhaps a bit of an apples and oranges issue, but some here might be interested in work we presented earlier this year at the Eurosys 2009 conference:
http://www.eecg.toronto.edu/~ashvin/publications/timely-s...
Our work might be thought of somewhat like a deadline scheduler. Instead of deadlines, we focus on release-times--i.e. when the application would like to execute. In our model, the application partitions it's own work into time-critical and computational events. It uses a new system call to supply timing (release-times) directly to the kernel, and to cooperate with other time-sensitive tasks.
A central thesis of our work is that responsiveness (running when you want to run) and fairness (amount of time one gets) should be independent.
Bottom line: we can maintain 1ms range responsiveness even while the system is 100% loaded. Our work is targeted to adaptive applications, i.e. those that can adapt quality by skipping less important work, so as to maintain timing for the more important stuff.
In the paper, we give examples with video, and also modified the X11 server.
-- Buck
(Log in to post comments)
An alternative approach Posted Oct 14, 2009 10:54 UTC (Wed) by raistlin (guest, #37586) [Link]
Actually, I'm very interested in that, and I was not aware of this work... I'll surely take a look at it... Thanks!
Regards,
An alternative approach Posted Oct 16, 2009 3:41 UTC (Fri) by njs (guest, #40338) [Link]
There was some discussion here a few months ago too that you might find interesting: http://lwn.net/Articles/340023/
An alternative approach Posted Oct 22, 2009 14:51 UTC (Thu) by renox (subscriber, #23785) [Link]
It seems that both the patch and the paper would be more usefully posted to lkml (especially now since apparently the deadline scheduler is studied): lwn is hardly the good place for this discussion..
|
|||||||||||||