Affiliation:
1. Kyushu University, Fukuoka-shi, 812-8581, Japan
Abstract
Traditional operating systems control the execution of programs regardless of how often they are run. This raises the question: can't the often run or the often used programs provide better performance if an operating system had an ability to optimize their execution behavior based on a knowledge the operating system had obtained from their previous execution(s)? In this paper, we integrate this ability into a part of an operating system called a process scheduler and examine its cost and benefit. Our initial evaluations show that the cost involved in our scheduler is small and the processing time can be reduced by using this scheduler.
Publisher
Association for Computing Machinery (ACM)
Reference11 articles.
1. Lottery scheduling: flexible scheduling proportional-share resource management;Waldspurger C.;Proc. of the 1st USENIX Symposium on Operating Systems Design and Implementation,1994
2. CPU reservations and time constraints
3. CPU inheritance scheduling
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Artificial Intelligence and Qubit‐Based Operating Systems;Quantum Computing in Cybersecurity;2023-10-13
2. Towards a Machine Learning-Assisted Kernel with LAKE;Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2;2023-01-27