On Thu, Jan 14, 2016 at 04:24:52PM +0100, Luca Abeni wrote:The original algorithm, yes, it allowed to use 100% of the CPU time, starving
+++ b/include/uapi/linux/sched.h
@@ -48,5 +48,6 @@
* For the sched_{set,get}attr() calls
*/
#define SCHED_FLAG_RESET_ON_FORK 0x01
+#define SCHED_FLAG_RECLAIM 0x02
With an eye towards unpriv usage of SCHED_DEADLINE, this isn't something
we could allow unpriv tasks, right? Since (IIRC) GRUB will allow eating
all !deadline time.
Something with an average runtime/budget that also puts limits on theI'll try to think about this... The advantage of GRUB is that a theoretically
max (say 2*avg) would be far more amenable to be exposed to unpriv
tasks, except since that would directly result in an average tardiness
bound this might be non-trivial to combine with tasks not opting for
this.