Not sure if this question concerns this group .. Writing a small
application which creates schedules based on the ( Least Laxity First )
LLF algorithm . Not sure at what instants is the scheduler invoked ?
i.e. the task with least laxity is selected at every time unit ? Also,
if i take into consideration the context switch time , how would it
effect the algorithm ?
Thanks ,
vivekian
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [email protected]
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
[Index of Archives]
[Kernel Newbies]
[Netfilter]
[Bugtraq]
[Photo]
[Stuff]
[Gimp]
[Yosemite News]
[MIPS Linux]
[ARM Linux]
[Linux Security]
[Linux RAID]
[Video 4 Linux]
[Linux for the blind]
[Linux Resources]