Operating Systems Engineering OS Scheduling. By Dan Tsafrir, 27/4/2011. What’s OS scheduling. OS policies & mechanisms to allocate resources to entities Enforce a policy (e.g., “shortest first”) Using an OS mechanism (e.g., “thread chooser”) Entities
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
By Dan Tsafrir, 27/4/2011
[Dec, 2010; Dolev, Feitelson, Linial et. Al; TR]
“We deﬁne fairness in such a scenario as the situation where every user either gets all the resources he wishes for, or else gets at least his entitlement on some bottleneck resource, and therefore cannot complain about not getting more. We then prove that a fair allocation according to this deﬁnition is guaranteed to exist for any combination of user requests and entitlements. The proof, which uses tools from the theory of ordinary differential equations, is constructive and provides a method to compute the allocations numerically.”
[Jun 2010; Zheng, Viennot, Nieh; SIGMETRICS]
“We present RSIO, a processor scheduling framework for improving the response time of latency-sensitive applications
by monitoring accesses to I/O channels and inferring when
user interactions occur.
RSIO automatically identiﬁes processes involved in a user interaction and boosts their priorities at the time the interaction occurs to improve system response time.
RSIO also detects processes indirectly involved in processing an interaction, automatically accounting for dependencies and boosting their priorities accordingly.”
[Aug 2007; Tsafrir, Etsion, Feitelson; USENIX Security]