Multi-Task Processor Dynamic Scheduling for QoS
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In multi-task systems with limited processor resources, real-time multimedia streaming services often prioritize tasks over low-priority tasks, leading to delayed or postponed execution of low-priority tasks such as file transfers and man-machine interfaces, resulting in reduced quality of service (QoS) for non-real-time tasks.
Innovation Solution
A method where the processor compares task priorities, executes high-priority tasks for a specified duration, suspends their execution to process low-priority tasks, and adjusts the execution time based on network bandwidth and processing time to maintain QoS for low-priority tasks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If the real-time multimedia streaming service increases the transmission bit rate to improve multimedia quality, then the quality of service for multimedia streaming is improved, but the processing time increases and the quality of service for other low priority tasks deteriorates
Solution Approach 1:
The patent implements dynamic task scheduling that adjusts the execution strategy based on task type and system state. The processor dynamically switches between executing high-priority tasks to completion and suspending them to execute low-priority tasks, creating a flexible scheduling mechanism that adapts to different processing scenarios and prevents low-priority tasks from being indefinitely delayed
Solution Approach 2:
The patent introduces periodic suspension and resumption of high-priority tasks at predetermined intervals. This periodic action ensures that low-priority tasks receive regular processing opportunities while high-priority tasks are eventually completed, creating a balanced execution pattern that prevents starvation of either task type
2Reliability
If the multi-task system prioritizes real-time multimedia streaming service execution, then the real-time task completion is ensured, but the low-priority tasks are delayed or postponed
Solution Approach 1:
The patent implements dynamic task scheduling that adjusts the execution strategy based on task type and system state. The processor dynamically switches between executing high-priority tasks to completion and suspending them to execute low-priority tasks, creating a flexible scheduling mechanism that adapts to different processing scenarios and prevents low-priority tasks from being indefinitely delayed
Solution Approach 2:
The patent applies partial action by suspending high-priority tasks before complete execution and resuming them later. This partial execution approach allows the system to allocate processing time to low-priority tasks while ensuring high-priority tasks are eventually completed, balancing both task types' requirements
3Productivity
If the processor allocates unlimited resources to the first task, then the first task execution efficiency is improved, but the second task execution is influenced and delayed
Solution Approach 1:
The patent segments the execution of the first task into multiple intervals by suspending it at predetermined times to execute the second task. This segmentation divides the first task's execution into chunks separated by second task execution periods, ensuring both tasks receive processing time and preventing the second task from being indefinitely delayed
Solution Approach 2:
The patent introduces periodic suspension and resumption of the first task at predetermined intervals. This periodic action ensures that the second task receives regular processing opportunities while the first task is eventually completed, creating a balanced execution pattern that prevents starvation of either task type
Data Source
AI summary
A method for executing a first and a second task in M time units is disclosed. The method includes comparing the priority of the first task and the task. If the first task has a higher priority than the second task, the first task is executed. The first task is then suspended after the first duration, and the second task is executed for a second duration.