Improvement of lottery scheduling algorithm based on machine learning algorithm
Pages 894 - 897
Abstract
CPU process scheduling is essential to reduce idle time and improve the efficiency of processes and processors. Process scheduling determines which process will be executed, and the execution time. The operating system performs reasonable process scheduling to maximize the use of resources. This not only improves the operating efficiency of the operating system, but also makes users feel better about interacting with the computer. This article introduces the process scheduling technology and the memory layout of the process. Machine learning (ML) algorithms consider multiple attributes of a process to predict its turnaround-time (TaT).[1] They are used to allocate appropriate time slices in the Linux scheduler. Experiments can successfully reduce TaT through this method. And this article has made certain improvements to the lottery scheduling algorithm. Its average waiting time is reduced to a certain extent, and the operating efficiency of the operating system and the user's experience are improved.
References
[1]
Petrou D, Milford J W, Gibson G A. Implementing Lottery Scheduling: Matching the Specializations in Traditional Schedulers[C]//USENIX Annual Technical Conference, General Track. 1999: 1-14.
[2]
Waldspurger C A, Weihl W E. Lottery scheduling: Flexible proportional-share resource management[C]//Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation. 1994: 1-es.
[3]
Saparkhojayev N, Nugmanov Y, Apon A. Dynamic Lottery Scheduling[J]. Global Journal on Technology, 2013, 3.
[4]
Prassanna J, Venkataraman N. Adaptive regressive holt–winters workload prediction and firefly optimized lottery scheduling for load balancing in cloud[J]. Wireless Networks, 2019: 1-19.
[5]
Moonian O, Coulson G. LOTTERY SCHEDULING WITHOUT TICKET REPLACEMENT. ADDING DETERMINISM TO LOTTERY SCHEDULING[J]. 1999.
[6]
Pantuza G, Bleme L A C, Vieira M A M, Danian: Tail latency reduction of networking application through an o (1) scheduler[C]//2021 IEEE Symposium on Computers and Communications (ISCC). IEEE, 2021: 1-6.
[7]
Shukla D, Jain A, Choudhary A. Estimation of Ready Queue Processing Time Under SL Scheduling Scheme in Multiprocessors Environment[J]. International Journal of Computer Science and Security (IJCSS), 2010, 4(1): 74-81.
[8]
Tan H, Huang L, He Z, DMVL: An I/O bandwidth dynamic allocation method for virtual networks[J]. Journal of network and computer applications, 2014, 39: 104-116.
[9]
Waldspurger C A. Lottery and Stride Scheduling[R]. LCS Technical Report, 1995.
[10]
Sandholm T, Lai K. Dynamic proportional share scheduling in hadoop[C]//Workshop on Job Scheduling Strategies for Parallel Processing. Springer, Berlin, Heidelberg, 2010: 110-131.
[11]
Petrucci V, Loques O, Mossé D. Lucky scheduling for energy-efficient heterogeneous multi-core systems[C]//Proceedings of the 2012 USENIX conference on Power-Aware Computing and Systems. 2012: 7-7.
[12]
More S, Shukla D. Analysis and Extension of Methods in Ready Queue Processing Time Estimation in Multiprocessor Environment[C]//Proceedings of International Conference on Sustainable Computing in Science, Technology and Management (SUSCOM), Amity University Rajasthan, Jaipur-India. 2019.
[13]
Waldspurger C A, Weihl W E. An object-oriented framework for modular resource management[C]//Proceedings of the Fifth International Workshop on Object-Orientation in Operation Systems. IEEE, 1996: 138-143.
[14]
Chitralekha G. A Survey on Different Scheduling Algorithms in Operating System[M]//Computer Networks and Inventive Communication Technologies. Springer, Singapore, 2021: 637-651.
[15]
Wagner B, Kohn A, Neumann T. Self-Tuning Query Scheduling for Analytical Workloads[C]//Proceedings of the 2021 International Conference on Management of Data. 2021: 1879-1891.
- Improvement of lottery scheduling algorithm based on machine learning algorithm
Recommendations
A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
This paper proposes an efficient exact algorithm for the general single-machine scheduling problem where machine idle time is permitted. The algorithm is an extension of the authors' previous algorithm for the problem without machine idle time, which is ...
Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines
The deadline of a request is the time instant at which its execution must complete. The deadline of the request in any period of a job with deferred deadline is some time instant after the end of the period. The authors describe a semi-static priority-...
Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation
We consider various single machine scheduling problems in which the processing time of a job depends either on its position in a processing sequence or on its start time. We focus on problems of minimizing the makespan or the sum of (weighted) ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
June 2022
905 pages
ISBN:9781450397179
DOI:10.1145/3548608
Copyright © 2022 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 14 October 2022
Check for updates
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
ICCIR 2022
ICCIR 2022: 2022 2nd International Conference on Control and Intelligent Robot
June 24 - 26, 2022
Nanjing, China
Acceptance Rates
Overall Acceptance Rate 131 of 239 submissions, 55%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 91Total Downloads
- Downloads (Last 12 months)27
- Downloads (Last 6 weeks)7
Reflects downloads up to 15 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format