SoC Interface Device Request Queue Manager
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In the context of system-on-chip (SoC) technology, existing interface devices and systems face challenges in efficiently managing request queues and prioritizing requests, which affects the Quality of Service (QoS) and operating frequency due to the complexity of integrating multiple functions on a single chip.
Innovation Solution
The proposed solution involves an interface device with a request queue manager that includes priority comparators to swap items based on request priorities, using occupying bits to manage the request queue and generate swapping signals, effectively implementing a soft first-in first-out (FIFO) buffer to optimize data transmission and processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a conventional request queue management system is used in SoC interface devices, then the system structure is simpler, but the Quality of Service (QoS) and operating frequency are reduced due to inefficient request prioritization
Solution Approach 1:
The request queue is divided into multiple elements (e.g., 8 elements) that can be independently managed and swapped. Each element can hold a request, and the queue manager can selectively swap between elements based on priority, allowing fine-grained control over request processing without requiring a complete redesign of the queue structure.
Solution Approach 2:
The request queue management system implements dynamic swapping of queue elements based on priority comparisons. The queue manager can change the order of requests in real-time by swapping elements, allowing the system to adapt to varying priority requirements while maintaining a relatively simple underlying queue structure.
2Productivity
If priority-based request swapping is implemented in the interface device, then the operating frequency and QoS are enhanced, but the device complexity increases due to additional priority comparators and swapping logic
Solution Approach 1:
The priority comparison function is segmented into multiple independent priority comparators, each responsible for comparing specific queue elements. This allows the comparison operations to be performed in parallel, increasing operating frequency while keeping each individual comparator simple and manageable.
Solution Approach 2:
The priority comparison and queue swapping functions are merged into a single integrated queue manager unit. This consolidation allows the system to achieve enhanced QoS and operating frequency through unified priority-based management, while the complexity is contained within a single functional block rather than being distributed across multiple separate components.
3Adaptability or versatility
If a soft FIFO buffer with swapable elements is used, then request prioritization is improved, but the manufacturing complexity increases compared to a conventional FIFO structure
Solution Approach 1:
The FIFO buffer is implemented as a dynamic structure where elements can be swapped based on priority rather than following a strict first-in-first-out sequence. This dynamic capability is achieved through controlled swapping operations that maintain the essential FIFO property for equal-priority requests while allowing reordering for different priorities, balancing adaptability with manufacturability.
Data Source
AI summary
An interface device includes a request queue and a request queue manager. The request queue includes multiple elements configured to receive corresponding requests from at least one master device and to indicate whether the corresponding requests are included using corresponding occupying bits. The request queue manager is configured to manage the request queue at least based on the occupying bits.