Resource-Task Mapping for Constrained Computing Systems

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Computing systems with constrained resources face challenges in matching desired tasks with available resources, leading to incomplete task execution and reduced throughput due to limited resource availability.

Innovation Solution

A resource-task mapping system that generates a map between desired tasks and resources, sorts resources based on their capability to perform tasks, and assigns tasks using a heuristic that prioritizes unique mappings and arbitrary selection to optimize task assignment in real-time environments.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If resources are constrained in the computing system, then resource availability is limited, but task completion rate decreases and throughput is reduced

Engineering Contradiction:
Improvetask completion rateVSAvoidthroughput
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The system performs preliminary actions by generating a resource-task map before task assignment, identifying which resources can perform which tasks in advance. This pre-computation enables faster real-time decision-making during task assignment, improving both task completion rate and throughput despite constrained resources

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent introduces an intermediary resource-task map data structure that mediates between available resources and desired tasks. This intermediary structure stores pre-computed compatibility information, enabling efficient matching without direct complex calculations during task assignment, thereby improving system productivity and task completion reliability

Inventive Principle:
Principle #24Intermediary (Mediator)

2Productivity

If resources are sorted and assigned based on task counts, then task assignment efficiency improves, but system complexity increases due to map generation and sorting operations

Engineering Contradiction:
Improvetask assignment efficiencyVSAvoidsystem complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The system performs preliminary sorting of resources based on their task capability counts before actual task assignment. By pre-sorting resources in the resource-task map, the system reduces real-time computational complexity during task assignment, improving assignment efficiency while managing overall system complexity through structured pre-computation

Inventive Principle:
Principle #10Preliminary action

3Measurement precision

If a map is generated between tasks and resources, then task-resource matching accuracy improves, but processing time increases due to map generation and sorting

Engineering Contradiction:
Improvematching accuracyVSAvoidprocessing time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The system generates the resource-task map and performs resource sorting as preliminary actions before actual task assignment occurs. This pre-computation approach ensures high matching accuracy is achieved once, and then reused for multiple task assignments, reducing the time penalty for high-precision matching in real-time operations

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The resource-task map structure allows for dynamic updates and flexible querying. Once the map is generated with high precision, the system can efficiently adapt to changing task requirements through simple lookups and updates, maintaining matching accuracy while minimizing additional processing time for dynamic task assignments

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS9075654B1Method and apparatus for constraint programming of resources
Publication Date: 2015.07.07 MARVELL ISRAEL (M L S L) LTD
  • US9075654B1 patent drawing
  • US9075654B1 patent drawing
  • US9075654B1 patent drawing

AI summary

Systems and methods are provided for performing tasks in a machine having constrained resources for performing the tasks. A map is generated between desired tasks to be performed and resources of the machine that can be used to perform the desired tasks. The resources are sorted based on a number of the desired tasks that can be performed by each resource using the map. A first task to be performed is selected by the machine, and a first resource of the machine is selected to perform the selected first task based on the sorted order of the resources. The machine performs the selected first task using the selected first resource.