Heterogeneous Multi-Core Task Scheduling via Priority-Based Core Dispatch
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional task scheduling schemes in heterogeneous multi-core systems are not aware of the different computing powers of processor cores, leading to priority inversion where tasks with higher priority are delayed due to execution on cores with lower computing power.
Innovation Solution
A task scheduling method that identifies tasks by priority groups and dispatches them to processor cores based on computing power, ensuring that higher priority tasks are executed on cores with greater computing power, thereby reducing latency and response time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If conventional task scheduling scheme is used, then task scheduling is simple, but priority inversion occurs and task latency increases
Solution Approach 1:
The patent applies local quality by differentiating task scheduling based on processor core characteristics. High-priority tasks are selectively dispatched to high-performance cores while low-priority tasks can be scheduled on power-saving cores, creating localized optimization rather than uniform treatment across all cores
Solution Approach 2:
The scheduling algorithm dynamically adjusts task dispatching decisions based on changing system conditions including task priorities, processor core performance levels, and power consumption characteristics, allowing flexible adaptation to different scheduling scenarios
2Device complexity
If tasks are dispatched based on priority alone, then scheduling algorithm is simple, but higher priority tasks may be executed on lower computing power cores causing priority inversion
Solution Approach 1:
The patent differentiates scheduling strategies based on task priority levels and processor core capabilities, matching high-priority tasks with high-performance cores and low-priority tasks with power-saving cores, thereby ensuring reliable task execution while maintaining system simplicity
Solution Approach 2:
The scheduling algorithm performs preliminary assessment of task priorities and processor capabilities before task dispatching, pre-determining optimal core assignments to prevent priority inversion before it occurs
3Productivity
If heterogeneous processor cores are used, then system resource utilization can be improved, but load balance becomes difficult to maintain
Solution Approach 1:
The patent applies different scheduling policies to different processor core types, optimizing each core's workload according to its specific characteristics while maintaining overall system load balance through coordinated scheduling decisions
Solution Approach 2:
The scheduling algorithm dynamically adjusts task distribution across heterogeneous cores based on real-time system conditions, adapting to changing workload patterns and core availability to maintain optimal load balance
Data Source
AI summary
A task scheduling method is applied to a heterogeneous multi-core processor system. The heterogeneous multi-core processor system has at least one first processor core and at least one second processor core. The task scheduling method includes: referring to task priorities of tasks of the heterogeneous processor cores to identify at least one first task of the tasks that belongs to a first priority task group, wherein each first task belonging to the first priority task group has a task priority not lower than task priorities of other tasks not belonging to the first priority task group; and dispatching at least one of the at least one first task to at least one run queue of at least one of the at least one first processor core.