Storage Device Priority-Based Request Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The chain replication technique in storage systems is unable to issue Put requests to arbitrary nodes, leading to uneven processing execution in response to requests from multiple clients due to predetermined node assignments, resulting in network latency and inefficient resource management.
Innovation Solution
A storage device with a processor that receives update requests and priority information, determines if the new request's priority is higher than the ongoing update processing, cancels the preparation if necessary, and forwards the request to another storage device when higher priority is detected, ensuring that requests are executed based on their priority.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If chain replication technique is used to maintain Strong Consistency, then data consistency is improved, but request routing flexibility deteriorates
Solution Approach 1:
The patent introduces dynamic priority assignment for update requests based on client characteristics and request types. Instead of fixed predetermined routing, the system dynamically determines request handling priority and routing path, allowing flexible adaptation while maintaining consistency through priority-based processing control.
Solution Approach 2:
The patent changes the parameter of request processing by introducing priority levels (high, medium, low) that affect routing decisions. By modifying processing parameters based on priority, the system achieves both flexible routing and strong consistency, resolving the contradiction between adaptability and consistency maintenance.
2Device complexity
If predetermined node assignment is used in chain replication, then processing route is simplified, but resource management efficiency deteriorates
Solution Approach 1:
The patent replaces static predetermined node assignment with dynamic priority-based routing. The system dynamically assigns processing routes based on request priority and node status, improving resource management efficiency while maintaining relatively simple processing logic through priority-driven decision making.
Solution Approach 2:
The patent implements feedback mechanisms where nodes report their processing status and priority levels are adjusted accordingly. This feedback loop enables efficient resource allocation and prevents resource waste, improving productivity without significantly complicating the processing route structure.
3Adaptability or versatility
If Put requests are issued to arbitrary nodes, then request distribution is improved, but processing execution fairness deteriorates
Solution Approach 1:
The patent introduces priority as a key parameter that changes processing execution fairness. By assigning different priority levels to different requests based on client characteristics and request types, the system ensures fair processing execution while allowing arbitrary node issuance, thus resolving the contradiction between distribution flexibility and execution fairness.
Solution Approach 2:
The patent uses dynamic priority adjustment to maintain processing execution fairness. The system dynamically evaluates and adjusts request priorities in real-time, ensuring that regardless of which node receives the request first, fair execution is maintained through priority-based scheduling and coordination.
Data Source
AI summary
A storage device being one of a plurality of storage devices storing data includes a memory and a processor coupled to the memory. The processor executes determining, when having received a new request and a new priority information during a preparation for an execution of another update processing, whether a new priority indicated by the new priority information is higher than a priority of the update processing in the preparation. The process including canceling the update processing in the preparation when having determines at the determining that the new priority is higher than the priority of the update processing in the preparation. The process includes forwarding the new request and the new priority information to another storage device when having determined at the determining that the new priority is higher than the priority of the update processing in the preparation.