GPU Data Queuing via Banked Storage and Dynamic Selection

The queue structure is divided into multiple banks (e.g., first bank, second bank, third bank, fourth bank) that can operate independently. Each bank handles a portion of the data bits, allowing parallel operations and reducing conflicts. The segmentation enables the system to scale capacity without proportionally increasing wire routing complexity, as each bank has its own dedicated storage units and selection circuits.

The patent introduces a bank dimension to organize storage units, transforming a flat scaling approach into a multi-dimensional structure. Data bits are distributed across multiple banks, each with its own storage units and selection circuits. This dimensional organization allows parallel data processing and reduces wire routing congestion by localizing connections within each bank while maintaining high throughput across the entire queue structure.

The selection circuits dynamically route data bits to appropriate storage units based on current operation requirements. Instead of maintaining static connections for all possible data paths, the system activates only the necessary data lines and selection circuits for each operation. This dynamic routing reduces power consumption by minimizing active circuitry while maintaining the capability for high data throughput when needed.