Dynamic Process Allocation via Message Queue Reading Speed

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current job processing systems face challenges in determining the optimal number of concurrent processes due to various environmental factors, leading to resource wastage or system crashes when deploying on different customer environments.

Innovation Solution

A method that dynamically adjusts the number of processes based on attribute information related to the execution of a message queue, such as reading speed and rate of change, to maximize resource utilization and prevent system crashes.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If a default maximum number of processes is set, then the system can operate with a fixed process limit, but the system cannot adapt to different customer deployment environments and may cause resource wastage or system crashes

Engineering Contradiction:
Improveadaptability to different deployment environmentsVSAvoidprocess management complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent implements dynamic process management by continuously monitoring message queue reading speed and adjusting the number of concurrent processes in real-time. The system transitions from a static default maximum process limit to a dynamic adjustment mechanism that adapts to different customer deployment environments based on actual system performance characteristics

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent establishes a feedback loop where the system monitors message queue reading speed, compares it against thresholds, and adjusts the number of concurrent processes accordingly. This closed-loop control enables the system to automatically adapt to different deployment environments while maintaining optimal performance

Inventive Principle:
Principle #23Feedback

2Productivity

If the number of concurrent processes is increased to improve processing capacity, then productivity increases, but system stability decreases and crashes may occur

Engineering Contradiction:
Improvejob processing capacityVSAvoidsystem stability
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent dynamically adjusts the number of concurrent processes based on real-time message queue reading speed monitoring. When reading speed exceeds the threshold, the system increases process count to improve productivity; when reading speed drops below the threshold, the system decreases process count to maintain system stability and prevent crashes

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes the process management parameter (number of concurrent processes) based on the measured reading speed parameter. By establishing a relationship between reading speed and process count, the system optimizes productivity while maintaining stability through parameter adjustment

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS11636000B2Method, device, and computer program product for managing processes based on reading speed of a message queue
Publication Date: 2023.04.25 EMC IP HLDG CO LLC
  • US11636000B2 patent drawing
  • US11636000B2 patent drawing
  • US11636000B2 patent drawing

AI summary

Method, device, and computer program product for managing processes are disclosed. The method may include, in response to detecting a job to be executed in a job processing system, determining attribute information related to execution of a message queue in the job processing system; and determining, based on the attribute information, allocation information for a process to execute the job. The number of processes can be dynamically adjusted according to the current processing capacity of the job processing system, thereby improving the use of the resources of the job processing system and meanwhile avoiding crashing of the job processing system.