Image File Obtaining Method for Embedded Apparatus Startup Optimization

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The challenge is to shorten the startup time of embedded apparatuses, as the loading speed of image files directly affects user experience in devices like event data recorders and smart cameras, and existing methods like snapshot and scatter loading either require additional storage or are complex and resource-intensive.

Innovation Solution

An image file obtaining method that determines and sorts tasks based on execution and loading time ratios, allowing for concurrent loading and execution of tasks, thereby optimizing the startup process without additional storage or complex development efforts.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of time

If tasks are loaded sequentially in traditional order, then the image file structure is simple, but the startup time is long

Engineering Contradiction:
Improvestartup timeVSAvoidtask loading complexity
Core Design Contradiction:
Loss of timeVSDevice complexity

Solution Approach 1:

The patent applies preliminary action by calculating execution time and loading time for each task in advance, sorting tasks based on these pre-computed values, and arranging them in the image file before the embedded apparatus starts. This allows the system to load tasks in an optimized sequence that minimizes total startup time without requiring complex runtime decision-making.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent implements dynamics by making the task loading sequence adaptive rather than fixed. Tasks are dynamically sorted based on their execution and loading time characteristics, allowing the system to adjust the loading order according to actual performance metrics. This dynamic arrangement optimizes the balance between loading speed and execution efficiency.

Inventive Principle:
Principle #15Dynamics

2Productivity

If tasks with longer execution times are loaded first, then the total duration for completing tasks is shortened, but the loading sequence becomes more complex

Engineering Contradiction:
Improvetask completion speedVSAvoidlinking complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent applies parameter changes by using measurable time parameters (execution time and loading time) as the basis for task sorting. By converting qualitative task characteristics into quantitative time parameters, the system can objectively rank tasks and arrange them in the image file to optimize completion speed. The linking process uses these parameter values to automatically determine task sequences without manual intervention.

Inventive Principle:
Principle #35Parameter changes

3Loss of time

If the image file is loaded completely before execution, then the system is stable, but the startup time is increased

Engineering Contradiction:
Improvestartup timeVSAvoidsystem stability
Core Design Contradiction:
Loss of timeVSReliability

Solution Approach 1:

The patent applies segmentation by dividing the image file into distinct task segments that can be loaded and executed in a controlled sequence. Instead of loading the entire image file before execution, the system segments the tasks and loads them in an optimized order, allowing partial loading during the startup process while maintaining system stability through proper task management.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS12118339B2Image file obtaining method and apparatus
Publication Date: 2024.10.15 HUAWEI TECH CO LTD
  • US12118339B2 patent drawing
  • US12118339B2 patent drawing
  • US12118339B2 patent drawing

AI summary

An image file obtaining method includes: determining a first value of each of N tasks in program source code, where the first value is first duration required for executing each of the N tasks or the first value is a ratio of the first duration to second duration, the second duration is duration required for loading each of the N tasks, and N is a positive integer; sorting the N tasks in descending order of the first values; and linking the sorted N tasks to obtain an image file. After downloading the image file, an embedded apparatus successively loads and executes the sorted N tasks, thereby shortening a startup time period of the embedded apparatus.