Abstract -In this paper, we present a fast and scalable pipelined priority queue architecture for use in high-performance switches with support for fine-grained quality of service (QoS) guarantees. Priority queues are used to implement highest-priority-first scheduling policies. Our hardware architecture is based on a new data structure called a Pipelined heap, or P-heap for short. This data structure enables the pipelining of the enqueue and dequeue operations, thereby allowing these operations to execute in essentially constant time. In addition to being very fast, the d t e c t u r e also scales very well to a large number of priority levels and to large queue sizes. We give a detailed description of this new data structure, the ~~9 0 -ciated algorithms and the corresponding hardware implementation. We have implemented this new architecture using a 0.35 micron CMOS technology. Our current implementation can support 10 Gbls C O M~C~~O~S with over 4 billion priority levels .
Bhagwan and Lin REF proposed a new pipelined priority queue architecture based on p-heap (a new data structure similar to binary heap).
Fast and scalable priority queue architecture for high-speed network switches
Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
Computer Science