Task Allocation Using Predicted Node Resource States

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing distributed systems often waste resources by simply selecting nodes with more available resources without considering the resources needed after task completion, leading to inefficiencies.

Innovation Solution

A method that determines a node's current and predicted resource states, using a state transition policy to prioritize nodes based on their suitability for a task, reducing resource waste by optimizing task allocation.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If nodes with more available resources are selected for task allocation, then task completion capability is improved, but resource waste increases

Engineering Contradiction:
Improvetask completion capabilityVSAvoidresource waste
Core Design Contradiction:
ProductivityVSLoss of energy

Solution Approach 1:

The system performs preliminary prediction of resource states after task completion before making allocation decisions. By predicting the second state (resource state after task completion) in advance, the system can proactively identify nodes that will have optimal resource utilization, preventing resource waste before it occurs. This is embodied in the prediction module that forecasts future resource states and the state transition policy that prioritizes transitions to optimal states.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system establishes a feedback loop by continuously monitoring current resource states, predicting future states, and using this information to optimize task allocation decisions. The state transition policy acts as feedback mechanism that guides allocation toward nodes that will achieve optimal resource utilization, creating a closed-loop control system that continuously improves resource efficiency based on predicted outcomes.

Inventive Principle:
Principle #23Feedback

2Speed

If simple resource-based selection is used, then allocation speed is improved, but resource utilization efficiency deteriorates

Engineering Contradiction:
Improveallocation speedVSAvoidresource utilization efficiency
Core Design Contradiction:
SpeedVSProductivity

Solution Approach 1:

The system pre-calculates and stores state transition policies that map current states to optimal target states. This preliminary preparation allows the allocation system to make intelligent decisions without performing complex real-time calculations, maintaining high allocation speed while improving resource utilization efficiency through pre-analyzed optimal transition paths.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system transforms the allocation decision from a simple resource-quantity comparison to a state-transition optimization problem. By changing the decision parameters from raw resource counts to predicted state transitions, the system achieves both speed and efficiency - using pre-computed state transition policies to quickly identify optimal allocations without sacrificing utilization efficiency.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS20250390349A1Method, device, and product for allocating target task
Publication Date: 2025.12.25 DELL PROD LP
  • US20250390349A1 patent drawing
  • US20250390349A1 patent drawing
  • US20250390349A1 patent drawing

AI summary

A method illustratively includes acquiring a request for allocation of a target resource for the target task. The method further includes determining a first state and a second state of each node in multiple nodes, wherein the first state is indicative of a current state of available resources of each node, and the second state is indicative of a predicted state of available resources of each node after completion of the target task. The method further includes selecting, based on the first state, the second state, and a state transition policy indicative of a priority of a transition between states, a target node from the multiple nodes for use in performing the target task. This method not only analyzes the current available resources of each node, but also takes into account the predicted available resources after the node completes the target task, and thus can find a more suitable node.