Rotating Priority Queue Manager for Parallel Processing Arbitration
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing parallel processing systems face bottlenecks due to inefficient data routing arbitration, particularly in scenarios where data source and processing channels have equal priority, leading to potential starvation or blocking of channels, and existing arbitration schemes fail to dynamically adjust based on availability and readiness.
Innovation Solution
A Rotating Priority Queue Manager (RPQ) system using logic gates and n-bit priority registers to dynamically assign priorities to data source/processing resource channels based on availability and readiness, ensuring equal priority arbitration and minimizing latency, with the ability to rotate priorities to prevent channel starvation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If static arbitration schemes are used to direct data source channels, then priority-based routing is achieved, but channels with equal priority suffer from starvation or blocking
Solution Approach 1:
The patent implements dynamic priority assignment where the arbitration scheme rotates through different channel priorities in a round-robin fashion. This dynamic rotation ensures that no single channel permanently dominates the shared data path, preventing starvation of channels with equal priority while maintaining efficient throughput.
2Device complexity
If single-interface systems are implemented to reduce board space and pin requirements, then routing complexity is reduced, but data transmission becomes a bottleneck
Solution Approach 1:
The patent employs look-ahead buffering where data is pre-loaded into buffers before being needed by processing channels. This preliminary action allows the single interface to maintain high throughput by having data ready for immediate transmission without waiting for processing channels to be fully ready, thus preventing bottlenecks.
3Adaptability or versatility
If dynamic rotating arbitration schemes are used to handle priority-associated data sources, then fluid priority decisions are achieved, but the schemes remain dependent on predetermined rotation and cannot adapt to real-time availability
Solution Approach 1:
The patent incorporates feedback mechanisms where the arbitration logic monitors the actual state of data sources and processing channels in real-time. This feedback allows the system to adjust the rotation schedule dynamically, skipping channels that have no data ready or channels that are not ready to receive data, thereby optimizing throughput while maintaining fairness.
Data Source
AI summary
The present invention is a rotating priority queue manager. A rotating priority queue manager in accordance with the present invention may include a plurality of source data channels, a corresponding plurality of processing resources, and an arbitrating interface directing the flow of data from the source channels to the processing resources where the data must flow over a shared data path.The plurality of processing resources may comprise any system of parallel processors where the servicing of input data must be carried out in a manner where there the maximum latency for processing a given data channel is determinable, the arbitration between channels is equal, no input channel may prevent another channel from being serviced, and lower priority processing resources are not prohibited from receiving input data if higher priority processing resources are not currently available or if higher priority data is not currently available.