Q-Manager for Dynamic Process Network Completion Tracking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data processing systems face challenges in determining successful completion of a network of processes, especially in dynamic environments where the graph structure is unknown, leading to difficulties in managing transactions and maintaining data integrity.
Innovation Solution
A method and system represented as a directed acyclic graph (DAG) where nodes are processes and edges are events, utilizing a Q-Manager to track the state of the graph through message transmission, allowing for dynamic changes and notification of successful completion without prior knowledge of the graph structure.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If two-phase commit protocol is used to manage transactions, then data integrity is maintained, but system overhead increases and adaptability to dynamic process networks decreases
Solution Approach 1:
The patent extracts the completion tracking logic from the traditional two-phase commit protocol and implements it as a separate Q-Manager component. This manager dynamically tracks process completion states and determines when the entire network has successfully completed, separating the reliability function from the transaction protocol overhead.
Solution Approach 2:
The system dynamically adapts to changing process networks by maintaining a flexible representation of the process graph where nodes and edges can be added or removed during execution. The Q-Manager dynamically updates its tracking of completion states based on the current network structure, allowing the system to handle dynamic topologies without predefined knowledge.
2Reliability
If two-phase commit protocol is used, then transaction success/failure is determined, but difficulty in determining completion increases in dynamic environments
Solution Approach 1:
The Q-Manager implements a feedback mechanism where processes report their completion status to the manager, which then updates the overall network completion state. This continuous feedback loop allows the system to dynamically determine when all processes have successfully completed, even as the network topology changes during execution.
Solution Approach 2:
The Q-Manager serves multiple functions: it tracks individual process completion, determines overall network completion, and adapts to dynamic topologies. This universal component handles various scenarios including process failures, dynamic additions, and topological changes through a unified approach.
3Adaptability or versatility
If dynamic process networks are allowed with unknown graph structure, then adaptability increases, but ability to determine successful completion decreases
Solution Approach 1:
The system establishes a Q-Manager at the beginning of process execution that is specifically designed to track completion states. This preliminary setup enables the manager to dynamically adapt to any graph structure that emerges during execution, maintaining reliability in completion determination despite the unknown initial topology.
Data Source
AI summary
The present invention involves methods and systems for managing successful completion of a network of processes. The network of processes can be represented as a graph. In this representation, the nodes of the graph represent the processes, and the edges of the graph represent events associated with the processes. Processing starts at the root node, and is based on the result of an initially unknown graph. When an event is to be produced or consumed, a message to that effect is transmitted to a component called a Q-Manager. Using the messages, which are received in event order, the Q-Manager keeps track of the state of the graph, and determines when successful completion of the processing has occurred. Once this occurs, the Q-Manager sends a notification indicating completion of the network.