Service Update Sequence Prediction for Parallel Dependency Management

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing data manager update processes often result in prolonged downtime and inefficient resource utilization due to the sequential nature of updates, which can disrupt dependent services and prolong the overall update completion time.

Innovation Solution

A method and system for managing updates by identifying service sub-trees, predicting an update window, and initiating updates in parallel for independent services within the service call graph, ensuring minimal disruption and reduced downtime.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If sequential updates are performed for services, then service dependency constraints are satisfied, but update completion time is prolonged and resource utilization is inefficient

Engineering Contradiction:

Improveservice dependency satisfactionVSAvoidupdate completion speed

Core Design Contradiction:

ReliabilityVSProductivity

Solution Approach 1:

The service call graph is segmented into multiple service sub-trees based on independent services identified through hierarchical analysis. Each sub-tree represents a set of services that can be updated independently without affecting other sub-trees, enabling parallel update execution while maintaining dependency constraints within each sub-tree

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The update process transitions from a single-dimensional sequential execution model to a multi-dimensional parallel execution model by organizing services into hierarchical sub-trees. Independent sub-trees are executed in parallel across different computational threads, fundamentally changing the execution dimension from linear to concurrent

Inventive Principle:

Principle #17Another dimension (Dimensionality change)

2Stability of the object's composition

If sequential updates are performed for services, then service stability is maintained, but downtime is prolonged

Engineering Contradiction:

Improveservice stabilityVSAvoidupdate downtime

Core Design Contradiction:

Stability of the object's compositionVSLoss of time

Solution Approach 1:

The system performs preliminary analysis to identify independent service sub-trees and determine optimal update sequences before execution. Service sub-trees are pre-identified and ranked based on their independence and dependency relationships, allowing the system to prepare parallel execution paths in advance while maintaining stability constraints

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The update system maintains continuous service availability by executing updates in parallel across independent sub-trees rather than stopping the entire system. While some services are being updated, other independent services continue to operate, ensuring continuous useful action and minimizing overall downtime

Inventive Principle:

Principle #20Continuity of useful action

Data Source

PatentUS11561777B2System and method for intelligent update flow across inter and intra update dependencies

Publication Date: 2023.01.24 EMC IP HLDG CO LLC

AI summary

A method for managing updates of a data manager includes: obtaining a service call graph where the service call graph includes services grouped into service sub-trees and specifies a service hierarchy between the services; identifying the service sub-trees of the service call graph; identifying, using the service hierarchy, independent services among the services of the service call graph; generating, based on identifying the service sub-trees and the independent services, an update sequence for the services; predicting, using the update sequence and the services, an update window for the service sub-trees; and initiating an update of the services using the prediction of the update window.