Graph-Based Data Flow Control for SCP Subsystems

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional data flow control systems lack the ability to coordinate the operation of System Control Processor (SCP) subsystems across different locations, leading to inefficiencies in data manipulation and exchange, particularly in processing workloads that require multiple services across various SCP subsystems.

Innovation Solution

A graph-based data flow control system that identifies workloads, generates SCP-local and inter-SCP data flow control graphs to define how services within and between SCP subsystems manipulate and exchange data, and transmits these graphs to the subsystems to coordinate their operations effectively.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If conventional data flow control systems are used, then system simplicity is maintained, but the ability to coordinate services across multiple SCP subsystems deteriorates

Engineering Contradiction:
Improvecoordination capabilityVSAvoidsystem complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent segments the data flow control into two distinct components: local data flow control graphs that manage services within individual SCP subsystems, and inter-SCP data flow control graphs that coordinate between subsystems. This segmentation allows each component to operate independently with well-defined interfaces, enabling complex multi-subsystem coordination while maintaining manageable complexity through modular design.

Inventive Principle:
Principle #1Segmentation

2Productivity

If graph-based data flow control is implemented, then service coordination efficiency improves, but data processing overhead increases

Engineering Contradiction:
Improveservice coordination efficiencyVSAvoiddata processing overhead
Core Design Contradiction:
ProductivityVSLoss of energy

Solution Approach 1:

The patent performs preliminary action by pre-defining data flow control graphs that specify the complete coordination logic for services across SCP subsystems before runtime. These graphs are generated and validated in advance, allowing the system to execute pre-planned coordination sequences without performing complex real-time analysis, thereby improving coordination efficiency while minimizing runtime processing overhead.

Inventive Principle:
Principle #10Preliminary action

3Productivity

If multiple services across different SCP subsystems are coordinated, then workload processing capability improves, but system reliability requirements increase

Engineering Contradiction:
Improveworkload processing capabilityVSAvoidsystem reliability
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent implements feedback mechanisms where SCP subsystems report their service status, data flow states, and operational metrics back to the control plane. The control plane uses this feedback to dynamically adjust inter-SCP data flow control graphs, ensuring that coordination maintains system reliability even when processing complex workloads across multiple subsystems. Feedback loops enable real-time detection and correction of coordination issues.

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS11593279B2Graph-based data flow control system
Publication Date: 2023.02.28 DELL PROD LP
  • US11593279B2 patent drawing
  • US11593279B2 patent drawing
  • US11593279B2 patent drawing

AI summary

A graph-based data flow control system includes a control plane system coupled to SCP subsystems. The control plane system identifies a workload, and identifies service(s) on the SCP subsystems for manipulating/exchanging data to perform the workload. The control plane system generates a respective SCP-local data flow control graph for each SCP subsystem that defines how their service(s) will manipulate/exchange data within that SCP subsystem, and generates inter-SCP data flow control graph(s) that define how service(s) provided by at least one SCP subsystem will manipulate/exchange data with service(s) provided by at least one other SCP subsystem. The control plane system then transmits each respective SCP-local data flow control graph to each of the SCP subsystems, and the inter-SCP data flow control graph(s) to at least one SCP subsystem, for use by the SCP subsystems in causing their service(s) to manipulate/exchange data to perform the workload.