Queue Concatenation via Cross-Switch Matrix
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing queue memory structures in communications and data processing applications often face issues with data loss due to fixed, statically allocated sizes being insufficient for bursty data streams, and current methods of concatenating queues lead to delay, latency, and pin wastage by tying up interfaces.
Innovation Solution
The method and apparatus for queue concatenation allow dynamic reconfiguration of queues through a linked list arrangement, enabling any queue output to be routed to any queue input, extending queue length and accommodating asymmetrical bandwidth, using a hardware-based cross-switch matrix or software-driven switching mechanism.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If fixed sized queues with statically allocated memory are used, then device complexity is reduced and ease of manufacture is improved, but data loss occurs when bursty data streams exceed the fixed queue capacity
Solution Approach 1:
The queue memory is divided into multiple separate queue structures (first queue, second queue, etc.) that can be independently managed and concatenated. Each queue can be separately allocated and controlled, allowing the system to handle bursty data by distributing data across multiple segments rather than relying on a single large static queue.
Solution Approach 2:
The queue concatenation mechanism dynamically connects and disconnects queue structures based on data conditions. The system can dynamically allocate queue resources, concatenate queues when needed to handle bursts, and disconnect when not needed, transforming the static queue architecture into a dynamic one that adapts to varying data loads.
2Reliability
If queues are concatenated by externally connecting flow control interfaces, then queue length is extended and adaptability is improved, but delay and latency increase due to exiting and entering the chip through an interface
Solution Approach 1:
Multiple queue structures are merged into a single logical queue through internal concatenation. The first queue and second queue are combined such that data can flow continuously from one queue to another without exiting the chip, effectively extending the queue length while maintaining internal data flow and avoiding external interface delays.
Solution Approach 2:
An internal concatenation mechanism acts as an intermediary between separate queue structures, enabling direct internal connection between queue outputs and inputs. This intermediary mechanism allows queues to be connected without requiring external interface traversal, thereby reducing latency while still achieving queue extension.
3Adaptability or versatility
If external interface connection is used for queue concatenation, then queue flexibility is improved, but pin wastage occurs and interfaces are tied up
Solution Approach 1:
The external flow control interfaces are designed to serve multiple functions: they can independently control individual queues and also participate in internal concatenation operations. This multi-functionality allows the same interfaces to be used for both standalone queue control and concatenated queue operations, eliminating the need for additional dedicated pins for concatenation.
Solution Approach 2:
The queue concatenation mechanism uses the existing flow control interfaces to manage the concatenation process itself. The interfaces that were originally designed for external control are now also used to internally connect and disconnect queues, making the system self-sufficient and eliminating the need for separate concatenation control pins.
4Reliability
If external interface connection is used for queue concatenation, then queue extension is achieved, but queue control is lost
Solution Approach 1:
The flow control interfaces provide feedback signals that indicate the status of each queue (full, empty, intermediate states). This feedback mechanism enables the system to monitor queue conditions and dynamically control the concatenation process, ensuring that queues are connected and disconnected at appropriate times while maintaining full control over the concatenated queue structure.
Data Source
AI summary
A method and apparatus for queue concatenation have been disclosed.


