Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.23659 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912301306609664 |
|---|---|
| author | Sun, Xiaoxuan Duan, Yifei Deng, Yingnan Guo, Fan Cai, Guohui Peng, Yuting |
| author_facet | Sun, Xiaoxuan Duan, Yifei Deng, Yingnan Guo, Fan Cai, Guohui Peng, Yuting |
| contents | In this paper, an operating system scheduling algorithm based on Double DQN (Double Deep Q network) is proposed, and its performance under different task types and system loads is verified by experiments. Compared with the traditional scheduling algorithm, the algorithm based on Double DQN can dynamically adjust the task priority and resource allocation strategy, thus improving the task completion efficiency, system throughput, and response speed. The experimental results show that the Double DQN algorithm has high scheduling performance under light load, medium load and heavy load scenarios, especially when dealing with I/O intensive tasks, and can effectively reduce task completion time and system response time. In addition, the algorithm also shows high optimization ability in resource utilization and can intelligently adjust resource allocation according to the system state, avoiding resource waste and excessive load. Future studies will further explore the application of the algorithm in more complex systems, especially scheduling optimization in cloud computing and large-scale distributed environments, combining factors such as network latency and energy efficiency to improve the overall performance and adaptability of the algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_23659 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Dynamic Operating System Scheduling Using Double DQN: A Reinforcement Learning Approach to Task Optimization Sun, Xiaoxuan Duan, Yifei Deng, Yingnan Guo, Fan Cai, Guohui Peng, Yuting Machine Learning In this paper, an operating system scheduling algorithm based on Double DQN (Double Deep Q network) is proposed, and its performance under different task types and system loads is verified by experiments. Compared with the traditional scheduling algorithm, the algorithm based on Double DQN can dynamically adjust the task priority and resource allocation strategy, thus improving the task completion efficiency, system throughput, and response speed. The experimental results show that the Double DQN algorithm has high scheduling performance under light load, medium load and heavy load scenarios, especially when dealing with I/O intensive tasks, and can effectively reduce task completion time and system response time. In addition, the algorithm also shows high optimization ability in resource utilization and can intelligently adjust resource allocation according to the system state, avoiding resource waste and excessive load. Future studies will further explore the application of the algorithm in more complex systems, especially scheduling optimization in cloud computing and large-scale distributed environments, combining factors such as network latency and energy efficiency to improve the overall performance and adaptability of the algorithm. |
| title | Dynamic Operating System Scheduling Using Double DQN: A Reinforcement Learning Approach to Task Optimization |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2503.23659 |