OS Task Scheduler Dynamic Throughput Regulation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing task scheduling systems struggle to dynamically adjust the execution of tasks on an Operating System (OS) based on real-time processing loads, leading to inefficiencies such as excessive queuing, delayed job submissions, and suboptimal resource utilization.
Innovation Solution
A method and system that dynamically schedule task execution by obtaining weighted matrices representing tasks, computing a combined normalized weighted value, determining deviations from a threshold indicative of processing load, and regulating the throughput rate of task execution accordingly.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If the scheduling throughput is configured to allow high task submission rate, then the productivity is improved, but the system becomes overloaded leading to excessive queving and deteriorated response times
Solution Approach 1:
The patent implements dynamic adjustment of scheduling parameters based on real-time system load conditions. The workload scheduler continuously monitors system state and modifies task submission rates dynamically, transitioning from static pre-defined scheduling plans to adaptive scheduling that responds to current system capacity, thereby preventing overload while maximizing throughput during available capacity
Solution Approach 2:
The system incorporates feedback mechanisms where the workload scheduler monitors system load, queue lengths, and response times, then uses this information to adjust scheduling decisions. This closed-loop control allows the system to detect when response times are deteriorating and reduce submission rates accordingly, preventing the harmful effects of overload
2Reliability
If the scheduling throughput is configured to allow low task submission rate, then the system stability is improved, but the productivity decreases due to unnecessary delays
Solution Approach 1:
The scheduling system dynamically adjusts the task submission rate based on real-time system conditions. When the system is lightly loaded, the scheduler increases throughput to maximize productivity; when load increases, it reduces submission rate to maintain stability. This dynamic behavior eliminates the need for conservative static configurations
Solution Approach 2:
The patent changes scheduling parameters such as submission rate, batch size, and priority weights based on system state. By adjusting these parameters dynamically rather than using fixed values, the system can optimize for productivity during low-load periods and for stability during high-load periods, resolving the contradiction between these two objectives
3Device complexity
If static scheduling rules are used, then the device complexity is reduced, but the adaptability to varying system load decreases
Solution Approach 1:
The workload scheduler performs self-adjustment based on system feedback without requiring external intervention or complex manual configuration. The system monitors its own state and automatically modifies scheduling behavior, providing adaptability while keeping the control mechanism relatively simple through autonomous decision-making
Data Source
AI summary
This disclosure relates to a method and system for dynamically scheduling execution of tasks on an Operating System (OS). The method includes obtaining a plurality of weighted matrices corresponding to a set of tasks to be executed on the OS. The method further includes computing a combined normalized weighted value corresponding to the plurality of weighted matrices. The method further includes determining a deviation of the combined normalized weighted value from a predefined threshold value. The method further includes regulating a throughput rate of execution of the set of tasks based on the deviation.