Networked ECU Task Scheduling for Deadline Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing CPU scheduling techniques in in-vehicle electronic control systems face challenges in dynamically adjusting task execution to optimize processing load, leading to inefficiencies and difficulties in verifying deadline compliance due to the complexity of message transmission and processing loads.
Innovation Solution
An electronic system with multiple task processing units connected via a network, where task scheduling is dynamically adjusted based on processing load, allowing each unit to periodically execute tasks within predetermined time intervals, ensuring efficient CPU utilization and maintaining scheduling changes without affecting other processes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If message transmission priority is dynamically changed based on processing load, then deadline compliance is improved, but verification complexity increases due to infinite verification patterns
Solution Approach 1:
The patent implements dynamic task scheduling where the CPU dynamically adjusts task execution priority based on real-time processing load conditions. The scheduling unit changes the execution order of tasks (first task, second task, third task) depending on whether the CPU is in a high-load or low-load state, allowing the system to adapt to varying workload conditions while maintaining deadline compliance.
Solution Approach 2:
The patent changes the execution parameter (task scheduling order) based on the processing load parameter. When the CPU processing load exceeds a threshold, the system switches to a first scheduling pattern; when below the threshold, it uses a second scheduling pattern. This parameter-based switching resolves the verification complexity by limiting the number of scheduling patterns to verify.
2Adaptability or versatility
If LET interval is extended to accommodate E task execution time, then task execution flexibility is improved, but CPU utilization efficiency decreases
Solution Approach 1:
The patent makes the task execution schedule dynamic by adjusting the LET interval based on actual processing load conditions. Instead of using a fixed, conservatively large interval, the system dynamically shortens or extends the interval according to CPU load, allowing tighter scheduling when load is low and more flexibility when load is high, thereby improving CPU utilization while maintaining task execution guarantees.
Solution Approach 2:
The patent implements periodic task execution with variable periods. The scheduling unit periodically activates tasks within adjusted intervals based on processing load, allowing the system to optimize CPU utilization by reducing idle time during low-load periods while still guaranteeing task completion within the extended LET interval when needed.
Data Source
AI summary
In an electronic system, a plurality of task processing units that processes assigned tasks are connected via a network. Each of the plurality of task processing units includes a task activation unit that activates and executes the task, and third task processing in a third task processing unit uses at least a processing result of a first task in a first task processing unit or a processing result of a second task in a second task processing unit preceding the third task processing, and periodically executes a series of processing from the preceding first task processing or the second task processing to the third task processing at predetermined time intervals.