Distributed Processing System Load Balancing via Dual Key Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing distributed processing systems, such as those using the Chord routing algorithm, cannot simultaneously balance CPU and network loads, leading to potential bottlenecks and performance decline due to load imbalance.
Innovation Solution
The system separates the roles of routing and data management by using two distinct keys: a routing key for data transmission and an event key for managing event data, allowing independent balancing of CPU and network loads by defining order relations between these keys.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a single key is used for both routing and data management in distributed processing systems, then the system structure is simple, but both CPU load and network load cannot be balanced simultaneously
Solution Approach 1:
The patent segments the single key into two distinct keys: a routing key for data transmission routing and an event key for data management. This segmentation allows independent optimization of routing paths and data handling, enabling simultaneous balancing of both CPU load and network load without the constraints of a unified key system.
Solution Approach 2:
The patent extracts the routing function from the data management function by separating the routing key from the event key. The routing key is specifically extracted to handle only routing decisions, while the event key manages event data. This extraction resolves the contradiction by allowing each key to be optimized for its specific purpose, achieving load balancing for both CPU and network independently.
2Speed
If event data is transmitted to distributed processing devices using hash value routing, then routing is efficient, but load imbalance occurs when there is bias in event data distribution
Solution Approach 1:
The patent applies local quality by using the routing key specifically for routing decisions to maintain routing efficiency, while using the event key for data management to handle load distribution. This allows each key to have optimized properties for its specific function: the routing key preserves hash-based routing efficiency, while the event key manages load balance by controlling which devices process which events.
Solution Approach 2:
The patent changes the parameter structure from a single key to two keys with different functions. The routing key maintains the hash value property for efficient routing, while the event key introduces a new parameter for load-balanced event distribution. This parameter change allows the system to maintain routing efficiency while achieving uniform load distribution across devices.
Data Source
AI summary
For providing a technology capable of balancing a CPU load and a network load independently, a distributed processing system includes one or more distributed processing devices in a structured P2P network, and the distributed processing device is provided with a key holding means for holding a routing key which is a key (value) for which order relation is defined and used for routing data, and an event key which a key (value) for which order relation is defined with relation to the routing key, and is used for management of data; a distributed processing device initializing means for registering into a routing table a tuple including the event key and an address of the distributed processing device holding the routing key which has a predetermined relation with the routing key held in the key holding means; and a routing table storing means for storing the routing table holding the tuple.