Dynamic Task Scheduling with Priority Ranges
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing task scheduling methods lack flexibility and dynamic adjustment of priorities, leading to suboptimal performance in systems where tasks compete for shared resources, especially during system failures or performance deterioration.
Innovation Solution
A method that associates tasks with a range of priorities, allowing for dynamic changes in priority indications based on current system status and resource usage, enabling flexible task scheduling by selecting tasks for execution based on their priority levels and waiting times.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a static look-up table with fixed priorities is used for task scheduling, then system stability is guaranteed and no system starvation occurs, but the system lacks flexibility and cannot dynamically adapt to changing system situations
Solution Approach 1:
The patent transforms the static priority assignment into a dynamic system by introducing a priority indication that can be changed over time. Each task is associated with a range of priorities and a current priority indication that can be adjusted based on system status, allowing the scheduling system to adapt to changing conditions while maintaining structured control through the predefined priority ranges.
Solution Approach 2:
The patent changes the priority parameter from a fixed value to a dynamic value that can be adjusted within a predefined range. By associating each task with a range of priorities and dynamically modifying the current priority indication based on system status, the system can adapt task priorities to match current operational requirements while maintaining the structural framework of the original static assignment.
2Productivity
If known task scheduling algorithms like Round-Robin or Priority Inversion are used, then average task execution performance is improved, but the algorithms cannot dynamically adapt to seldom occurring system situations like system failure
Solution Approach 1:
The patent introduces a feedback mechanism where the scheduling system monitors system status and dynamically adjusts task priorities based on this feedback. The priority indication for each task can be modified in response to system conditions, allowing the system to adapt to uncommon situations such as system failures while maintaining efficient average performance through the structured priority ranges.
Solution Approach 2:
The patent makes the task scheduling system dynamic by allowing priority indications to change over time based on system status. This dynamic adjustment capability enables the system to respond to seldom occurring situations like system failures while maintaining the performance benefits of structured scheduling algorithms through the predefined priority ranges.
3Device complexity
If fixed priority values are assigned to tasks, then simple and deterministic scheduling is achieved, but the system cannot optimize resource allocation under varying system conditions
Solution Approach 1:
The patent modifies the priority parameter from a fixed value to a dynamic value that can be adjusted within a predefined range. This allows the system to maintain the simplicity of the original scheduling mechanism while enabling optimization of resource allocation under varying system conditions through dynamic priority adjustments.
Solution Approach 2:
The patent introduces dynamic capability to the scheduling mechanism by allowing priority indications to change based on system status. This maintains the structural simplicity of the scheduling system while enabling efficient resource allocation optimization through the dynamic adjustment of task priorities within their respective ranges.
Data Source
AI summary
A technique for scheduling tasks in a system is provided. A method implementation of this technique comprises the steps of providing at least one association between a task and a range of priorities for the task and using the at least one association for the task scheduling. The task scheduling may be provided by a task scheduling unit having access to a memory unit.