Task Scheduling via Virtual Runtime Adjustment for Rapid App Entry
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The increasing performance of electronic devices leads to delayed application entry due to resource-intensive computations, causing inefficiencies in task prioritization, particularly affecting user interface and audio-related tasks, resulting in incorrect UI drawings and audio noise.
Innovation Solution
An electronic device and method that allocate virtual runtimes to tasks during application entry, adjusting the runtime of priority tasks to a minimum value to facilitate rapid application entry by rearranging tasks in a red-black tree structure, ensuring timely CPU allocation without relying solely on priority changes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If priorities are assigned to all tasks related to application entry, then application entry speed is improved, but user interface and audio-related tasks are delayed causing incorrect UI drawings and audio noise
Solution Approach 1:
The patent segments tasks into different categories (application entry tasks vs. user interface and audio tasks) and applies different scheduling strategies to each segment. Application entry tasks are prioritized for rapid execution, while user interface and audio tasks maintain their normal scheduling to ensure reliability and prevent defects.
Solution Approach 2:
The patent applies local quality by assigning different virtual runtime characteristics to different task types. Application entry tasks receive minimized virtual runtime values to accelerate execution, while user interface and audio tasks retain standard virtual runtime values to maintain their execution reliability and prevent UI drawing errors and audio noise.
2Speed
If virtual runtime of priority tasks is adjusted to minimum value, then application entry is accelerated, but system resource allocation complexity increases
Solution Approach 1:
The patent changes the virtual runtime parameter for priority tasks by setting it to a minimum value during application entry period. This parameter modification enables accelerated task execution without requiring complex scheduling algorithms, as the virtual runtime adjustment is a simple numerical change that the existing scheduler can process efficiently.
Data Source
AI summary
Disclosed is an electronic device including at least one processor, and a memory operatively coupled to the at least one processor. The memory stores instructions configured to enable the at least one processor to identify, in response to running of an application, a plurality of tasks related to a running operation of the application, allocate virtual runtimes to the plurality of tasks when scheduling, adjust the virtual runtime of at least one task to be run with priority among the plurality of tasks to be a minimum value, arrange the at least one task with the adjusted virtual runtime, and run the at least one task with priority according to an arrangement order.


