Task Scheduling Circuit with Dynamic Priority Escalation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Scheduling of time-sensitive tasks in a system is challenging as it needs to balance the urgency of these tasks with the potential impact on other tasks, where delaying a time-sensitive task can affect system performance, and excessive prioritization can lead to unfair treatment of other queued tasks.
Innovation Solution
The implementation of scheduling circuitry that increases the priority of all queued tasks over time, while ensuring time-sensitive tasks with deadlines are prioritized by escalating their priority to a maximum when their deadline is reached, thereby ensuring timely completion without unfairly delaying other tasks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If a time-sensitive task is given high priority to ensure timely completion, then the deadline is met, but other tasks are unfairly delayed
Solution Approach 1:
The patent applies dynamic priority adjustment by periodically escalating the priority of time-sensitive tasks that are approaching their deadlines. Instead of static prioritization, the system continuously monitors task deadlines and dynamically adjusts priorities, allowing time-sensitive tasks to be promoted to higher priority levels as their deadlines approach, while non-time-sensitive tasks gradually lose priority over time. This dynamic mechanism resolves the contradiction by adapting priority levels based on real-time deadline proximity.
Solution Approach 2:
The system changes the priority parameter of tasks based on their deadline characteristics. Time-sensitive tasks have their priority parameter modified (escalated) when their deadline approaches, while other tasks experience gradual priority degradation. This parameter change mechanism ensures that deadline adherence is maintained for time-sensitive tasks without permanently compromising the productivity of other tasks in the system.
2Ease of operation
If all queued tasks have their priority increased over time, then fairness is improved, but time-sensitive tasks may still be delayed
Solution Approach 1:
The system performs preliminary action by proactively escalating the priority of time-sensitive tasks before their deadlines are reached. Rather than waiting for deadlines to expire or for unfair delays to occur, the scheduler anticipates deadline requirements and preemptively adjusts priorities. This preliminary priority escalation ensures that time-sensitive tasks are executed timely while still maintaining a fair scheduling mechanism for other tasks through gradual priority adjustment.
3Reliability
If a time-sensitive task occupies a resource for extended period, then the task completes successfully, but other tasks experience increased waiting time
Solution Approach 1:
The system implements periodic priority escalation for time-sensitive tasks rather than granting them permanent high priority. The scheduler periodically reviews and adjusts priorities based on current system state and deadline proximity. This periodic action allows time-sensitive tasks to receive necessary resource allocation and priority boosts only when needed, ensuring reliable completion while minimizing the duration of high resource occupation and reducing waiting time for other tasks.
Data Source
AI summary
There is provided an apparatus comprising scheduling circuitry, which selects a task as a selected task to be performed from a plurality of queued tasks, each having an associated priority, in dependence on the associated priority of each queued task. Escalating circuitry increases the associated priority of each of the plurality of queued tasks after a period of time. The plurality of queued tasks comprises a time-sensitive task having an associated deadline and in response to the associated deadline being reached, the scheduling circuitry selects the time-sensitive task as the selected task to be performed.