Parallel Transaction Processing in NETCONF Tree Data Structures
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing transaction processing methods in tree data structures for Network Configuration Protocol (NETCONF) incur high overheads in time and memory resources due to the need for copying a new tree before an update operation, which affects efficiency and resource utilization.
Innovation Solution
A transaction processing method that identifies non-conflicting transactions, performs reverse shallow copying in parallel to generate temporary trees, and merges these trees to update the base tree, reducing time and memory consumption while ensuring accurate and efficient transaction processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a new tree is copied before an update operation is performed on the base tree, then transaction isolation and data consistency are ensured, but time and memory resource overheads increase
Solution Approach 1:
The patent segments the tree copying process into selective shallow copying of only the modified subtree rather than copying the entire tree. This segmentation principle reduces the scope of copying operations from the whole tree structure to only the necessary modified portions, thereby reducing time overhead while maintaining transaction isolation through the snapshot mechanism
Solution Approach 2:
The patent uses shallow copying instead of deep copying to create temporary trees for transaction processing. By copying only the necessary tree structure elements (snapshots) rather than duplicating entire tree objects, the system reduces memory resource overhead while still ensuring data consistency and isolation between transactions
2Reliability
If a new tree is copied before an update operation is performed on the base tree, then transaction isolation and data consistency are ensured, but memory resource overheads increase
Solution Approach 1:
The patent segments the memory allocation for tree copying by using shallow copying techniques that allocate memory only for the modified subtrees rather than the entire tree structure. This selective memory allocation reduces the quantity of memory resources consumed while preserving transaction isolation through snapshot-based temporary trees
Solution Approach 2:
The patent employs shallow copying to create temporary tree structures that reference existing memory elements rather than duplicating them. This copying approach significantly reduces memory resource overhead by avoiding full tree duplication, while still ensuring data consistency through the snapshot mechanism that captures the base tree state before modifications
3Reliability
If transactions are processed serially with full tree copying, then data consistency is maintained, but transaction execution efficiency decreases
Solution Approach 1:
The patent segments the transaction processing workflow into parallelizable units by using selective shallow copying of modified subtrees. This segmentation allows multiple transactions to be processed in parallel on different CPU cores simultaneously, improving transaction execution efficiency while maintaining data consistency through the snapshot-based isolation mechanism
Solution Approach 2:
The patent introduces dynamic parallel processing capability by allowing transactions to be executed concurrently on multiple CPU cores when they operate on different subtrees. The system dynamically adjusts the degree of parallelization based on transaction conflicts, improving productivity while preserving data consistency through the snapshot mechanism that ensures isolation between conflicting transactions
Data Source
AI summary
A network device obtains, from a transaction queue, a plurality of transactions that do not conflict with each other, and performs reverse shallow copying in parallel for the transactions that do not conflict, to generate a plurality of temporary trees corresponding to the plurality of transactions. Because the plurality of transactions does not conflict with each other, processing the transactions in parallel can ensure accurate and proper transaction processing. In addition, generating the temporary trees in a reverse shallow copying manner can effectively reduce consumption of time and memory. Further, processing of the plurality of transactions is implemented by merging the plurality of temporary trees.