Arbitration Node Priority Signal Propagation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing arbitration systems in memory systems and network switches face challenges in efficiently prioritizing competing requests for a common resource, often relying on local priority states that can lead to the same request being chosen as the priority every time, lacking dynamic and efficient propagation of priority signals throughout the system.
Innovation Solution
A binary arbitration tree structure with arbitration nodes that propagate priority signals, allowing each node to determine priority based on signals from preceding nodes, using active and inactive request signals, priority signals, branch priority signals, and index signals to dynamically select the request with the highest priority for access to the common resource.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If local priority states are used in arbitration nodes, then each node can independently determine priority, but the same request may be chosen as priority every time and priority signals are not propagated dynamically throughout the system
Solution Approach 1:
The system segments the arbitration process into multiple levels (first level arbitration nodes and second level arbitration nodes), where each level handles specific priority determination tasks. This segmentation allows local independence at each level while enabling global priority propagation through the hierarchical structure.
Solution Approach 2:
The patent introduces intermediary components including priority encoders that convert priority signals into encoded forms for transmission, and arbitration nodes that decode and act on these signals. These intermediaries enable dynamic priority propagation while maintaining independent decision-making at each node.
2Productivity
If a binary arbitration tree structure is used, then multiple requests can be prioritized efficiently, but the system complexity increases with multiple arbitration nodes and signal propagation paths
Solution Approach 1:
The patent adds a hierarchical dimension to the arbitration tree structure, organizing arbitration nodes into multiple levels. This dimensional organization allows efficient parallel processing of priority signals while maintaining a structured approach that manages complexity through systematic arrangement rather than random complexity.
Solution Approach 2:
The system implements dynamic priority signal propagation where priority encoders and decoders actively transmit and process priority information throughout the tree structure. This dynamic approach allows the system to adapt to changing request priorities while maintaining an organized hierarchical framework that prevents complexity from becoming unmanageable.
3Adaptability or versatility
If priority signals are propagated throughout the binary tree structure, then dynamic prioritization is achieved, but the number of signals and communication overhead increases
Solution Approach 1:
The patent extracts and encodes priority information into compact signal forms that can be propagated efficiently through the arbitration tree. By taking out the essential priority data and representing it in an encoded format, the system reduces the effective quantity of signals needed while maintaining dynamic prioritization capabilities.
Solution Approach 2:
The system discards detailed priority information at intermediate arbitration nodes, keeping only the essential encoded priority signals for propagation. Priority information is recovered and acted upon at appropriate levels of the hierarchy, allowing dynamic prioritization with reduced signal overhead at each transmission stage.
Data Source
AI summary
Example implementations relate to an arbitration node. For example, an arbitration node can include instructions to receive, at the arbitration node at a level of a binary tree structure, a first request including a first request signal and a first priority signal and receive a second request including a second request signal and a second priority signal. In some examples, the arbitration node can include instructions to determine priority of requests by comparing the first request signal and the second request signal and by comparing the first priority signal and the second priority, and send a request signal and a priority signal of the request with the determined priority to a subsequent arbitration node at a subsequent level of the binary tree structure.