Task Execution Device Time-Sharing Scheduling Contradiction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional Operating Systems face inefficiencies in task scheduling, particularly when handling tasks that transition to a waiting state, leading to overhead and reduced processing power due to continuous adjustments in execution time, especially in environments with both guaranteed process performance tasks and asynchronous event-driven processes.
Innovation Solution
A task execution device that differentiates tasks into first-type and second-type tasks, where only the second-type tasks' allocated times are corrected to ensure completion within a cycle, reducing the load on task execution adjustments while maintaining fixed processing power, and includes features like power supply reduction units to conserve energy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If conventional OS continuously adjusts allocated time for tasks transitioning to waiting state, then task execution flexibility is improved, but processing power and efficiency deteriorate due to overhead
Solution Approach 1:
The patent segments tasks into two distinct types: first-type tasks (guaranteed process performance) and second-type tasks (asynchronous event-driven processes). This segmentation allows different scheduling strategies for each type, avoiding unnecessary adjustments for first-type tasks while maintaining flexibility for second-type tasks, thereby resolving the contradiction between adaptability and processing power.
Solution Approach 2:
The patent applies local quality by treating different task types differently in the scheduling system. First-type tasks receive fixed allocated time without continuous adjustment, while second-type tasks receive dynamic adjustment. This localized differentiation maintains processing power for critical tasks while providing adaptability where needed.
2Ease of operation
If conventional OS transfers execution permission to subsequent tasks when tasks enter waiting state, then task management simplicity is improved, but reliability deteriorates due to unguaranteed execution completion
Solution Approach 1:
By segmenting tasks into first-type (guaranteed execution) and second-type (asynchronous) categories, the system can ensure reliable execution completion for first-type tasks through fixed time allocation while maintaining simple management for second-type tasks. This segmentation resolves the contradiction between simplicity and reliability.
3Device complexity
If conventional OS executes no processes until allocated time expires for waiting tasks, then execution permission management is simplified, but productivity deteriorates due to wasted processing cycles
Solution Approach 1:
The patent segments tasks to apply different management strategies: first-type tasks maintain fixed allocated time without continuous monitoring, while second-type tasks allow flexible execution. This reduces the complexity of managing execution permission for first-type tasks while improving productivity by eliminating wasted cycles from waiting for time expiration.
4Adaptability or versatility
If conventional OS continuously adjusts allocated time for all tasks, then adaptability to task states is improved, but energy consumption increases due to continuous processing
Solution Approach 1:
The patent segments tasks into first-type (fixed time allocation) and second-type (dynamic adjustment) categories. This segmentation reduces energy consumption by eliminating continuous adjustments for first-type tasks while maintaining adaptability for second-type tasks, directly resolving the contradiction between adaptability and energy consumption.
Solution Approach 2:
The system applies local quality by providing dynamic time adjustment only where necessary (second-type tasks) while maintaining fixed allocation for other tasks (first-type tasks). This localized approach maintains necessary adaptability while significantly reducing overall energy consumption from continuous processing.
Data Source
AI summary
A task execution method for executing a plurality of tasks while switching the tasks from one to another by time-sharing, wherein an allocated time is allocated for each of the plurality of tasks, and the plurality of tasks includes a plurality of first-type tasks and a single second-type task, and the task execution method includes a task selection step which selects a task from among the plurality of tasks according to a predetermined sequence, a correction step which corrects an allocated time for the second-type task so that execution of the plurality of tasks completes within the cycle time, when the task selected is a second-type task, which is the total allocated time for the plurality of tasks, and a task execution control step which causes the selected task to be executed so that the execution of the selected task completes within the allocated time or the corrected allocated time.


