Storage System Routing Using Partial Addresses
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current storage systems face inefficiencies in packet transfer due to direct routing between memory units, leading to increased latency and number of transfer steps, especially when the distance between a connection unit and a memory unit is long.
Innovation Solution
The proposed storage system employs a routing unit that uses partial addresses to route packets between memory units, reducing the number of transfer steps by disregarding the least significant bits of destination addresses and utilizing a meshed network configuration with routing circuits and node modules arranged in a matrix, allowing diagonal routing and minimizing access concentration on specific memory units.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If direct routing between memory units is used, then the routing structure is simple, but the number of transfer steps increases and latency increases when the distance between connection unit and memory unit is long
Solution Approach 1:
The patent transitions from one-dimensional linear routing to two-dimensional meshed network routing with diagonal capabilities. By arranging routing circuits and node modules in a matrix configuration, packets can travel through multiple dimensions (horizontal, vertical, and diagonal paths), significantly reducing the number of transfer steps when the distance between connection unit and memory unit is long, while maintaining manageable routing complexity through structured address matching.
2Measurement precision
If full address routing is used, then precise destination addressing is achieved, but the number of transfer steps increases
Solution Approach 1:
The patent applies partial action by using only the necessary portion of the destination address (partial address matching) rather than requiring complete address comparison at each routing step. The routing circuit compares packet destination addresses with node module addresses and routes packets based on partial address matches, reducing the number of transfer steps while still achieving precise destination delivery through iterative partial matching.
3Productivity
If meshed network with diagonal routing is implemented, then the number of transfer steps is reduced, but the routing logic becomes more complex
Solution Approach 1:
The patent changes the routing parameter from requiring complex multi-dimensional coordinate calculations to using simplified address comparison parameters. By modifying how addresses are compared and matched in the routing logic, the system enables diagonal routing through the meshed network without proportionally increasing routing logic complexity. The address-based routing approach naturally accommodates diagonal paths while maintaining relatively simple comparison operations.
Data Source
AI summary
According to one embodiment, a storage system includes a plurality of memory units including a nonvolatile memory and a control unit which controls the nonvolatile memory, a routing unit which controls transfer of a packet between the memory units. The routing unit uses a partial address described in the packet and not the full address.