Post-Restart Resource Allocation for Cache Recovery and IO Continuity

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing resource allocation systems face interruptions during system restart due to excessive resource consumption in the initialization pre-application stage, leading to insufficient resources for subsequent preparation stage application and restoration stage input/output (IO) application, preventing the system from proceeding.

Innovation Solution

An asynchronous resource allocation method and system that reallocates resources from a pool by prioritizing requirements and using a loop mechanism to ensure both preparation stage application and IO restoration requirements are met, with a pull-to-refresh mechanism for cache data, ensuring smooth resource allocation.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If resources are allocated to initialization pre-application module, then initialization pre-application can proceed, but remaining resources in resource pool cannot meet preparation stage application or restoration stage IO application requirements

Engineering Contradiction:
Improveinitialization pre-application executionVSAvoidprocedure completion
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The resource allocation process is segmented into multiple stages (initialization pre-application, preparation stage application, restoration stage IO application) with distinct resource requirements. The patent implements a loop mechanism that iteratively allocates resources to different modules based on their specific requirements, ensuring that each stage receives adequate resources without interfering with other stages. This segmentation allows the system to meet all procedure requirements despite limited total resources.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent implements a feedback mechanism where the system continuously monitors remaining resources in the resource pool and adjusts allocation decisions accordingly. The loop mechanism checks whether current remaining resources can meet preparation stage application requirements and restoration stage IO application requirements, and modifies resource allocation based on this feedback. This ensures that resource allocation adapts to changing conditions and maintains procedure completion reliability.

Inventive Principle:
Principle #23Feedback

2Productivity

If initialization pre-application stage occupies excessive resources, then initialization pre-application can be completed, but system cannot proceed with subsequent procedures

Engineering Contradiction:
Improveinitialization pre-application speedVSAvoidprocedure continuity
Core Design Contradiction:
ProductivityVSEase of operation

Solution Approach 1:

The patent implements a dynamic resource allocation strategy where the system adjusts allocation priorities and resource distribution in real-time based on the current state of resource consumption. The loop mechanism dynamically evaluates remaining resources and modifies allocation decisions to ensure that initialization pre-application does not consume excessive resources at the expense of subsequent procedures. This dynamic adjustment maintains procedure continuity while allowing efficient initialization.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent performs preliminary resource allocation assessments before committing resources to initialization pre-application. The system evaluates resource requirements and available capacity in advance, and the loop mechanism continuously monitors resource consumption to prevent excessive occupation of resources. This preliminary action ensures that resource allocation supports both initialization speed and subsequent procedure execution.

Inventive Principle:
Principle #10Preliminary action

3Device complexity

If resources are allocated sequentially to different modules, then resource allocation is straightforward, but procedure interruption occurs when resources are insufficient

Engineering Contradiction:
Improveresource allocation processVSAvoidprocedure completion
Core Design Contradiction:
Device complexityVSReliability

Solution Approach 1:

The patent implements a continuous resource allocation loop that iteratively evaluates and allocates resources without interruption. The loop mechanism continuously checks whether remaining resources can meet preparation stage and restoration stage requirements, and adjusts allocation accordingly. This continuous action ensures that resource allocation proceeds smoothly through all stages without procedure interruption, maintaining both process simplicity and completion reliability.

Inventive Principle:
Principle #20Continuity of useful action

Solution Approach 2:

The patent dynamically changes allocation parameters such as resource priority, allocation quantity, and timing based on real-time resource availability and requirement analysis. The loop mechanism adjusts these parameters to optimize resource distribution across different modules and stages, preventing procedure interruption while maintaining a relatively simple allocation process. This parameter adjustment allows the system to adapt to varying resource conditions without complex procedural changes.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS12541396B2Resource allocation method and system after system restart and related component
Publication Date: 2026.02.03 INSPUR SUZHOU INTELLIGENT TECH CO LTD
  • US12541396B2 patent drawing
  • US12541396B2 patent drawing

AI summary

A resource allocation method and a system after system restart and a related component. The method comprises: allocating, from a resource pool, a first part of resources to an initialization pre-application module; allocating, from the resource pool, a second part of resources to a cache module, such that the cache module restores cache data to be restored that is in an initialization stage; and repeating the following steps: determining whether current remaining resources in the resource pool can meet a preparation stage application requirement of the cache module or whether there is an IO restoration requirement; allocating resources to the cache module or the IO module, from the resource pool, according to the result of determination; and determining whether the preparation stage application requirement and the IO restoration requirement are completely met, and if so, jumping out of the loop.