dorsal/arxiv
View SchemaA Grouped Sorting Queue Supporting Dynamic Updates for Timer Management in High-Speed Network Interface Cards
| Authors | Zekun Wang, Binghao Yue, Weitao Pan, Jianyi Shi, Yue Hao |
|---|---|
| Categories | |
| ArXiv ID | 2601.09081vv1 |
| URL | https://arxiv.org/abs/2601.09081 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
With the hardware offloading of network functions, network interface cards (NICs) undertake massive stateful, high-precision, and high-throughput tasks, where timers serve as a critical enabling component. However, existing timer management schemes suffer from heavy software load, low precision, lack of hardware update support, and overflow. This paper proposes two novel operations for priority queues--update and group sorting--to enable hardware timer management. To the best of our knowledge, this work presents the first hardware priority queue to support an update operation through the composition and propagation of basic operations to modify the priorities of elements within the queue. The group sorting mechanism ensures correct timing behavior post-overflow by establishing a group boundary priority to alter the sorting process and element insertion positions. Implemented with a hybrid architecture of a one-dimension (1D) systolic array and shift registers, our design is validated through packet-level simulations for flow table timeout management. Results demonstrate that a 4K-depth, 16-bit timer queue achieves over 500 MHz (175 Mpps, 12 ns precision) in a 28nm process and over 300 MHz (116 Mpps) on an FPGA. Critically, it reduces LUTs and FFs usage by 31% and 25%, respectively, compared to existing designs.
{
"annotation_id": "267f9cf8-1c0b-4ef6-9b93-5df2ae7c584e",
"date_created": "2026-02-17T05:53:20.227000Z",
"date_modified": "2026-02-17T05:53:20.227000Z",
"file_hash": "a8466ae0300ded08a0eb81297a00c4191af43256cac33e035d5bd7c2a4135ca4",
"private": false,
"record": {
"abstract": "With the hardware offloading of network functions, network interface cards (NICs) undertake massive stateful, high-precision, and high-throughput tasks, where timers serve as a critical enabling component. However, existing timer management schemes suffer from heavy software load, low precision, lack of hardware update support, and overflow. This paper proposes two novel operations for priority queues--update and group sorting--to enable hardware timer management. To the best of our knowledge, this work presents the first hardware priority queue to support an update operation through the composition and propagation of basic operations to modify the priorities of elements within the queue. The group sorting mechanism ensures correct timing behavior post-overflow by establishing a group boundary priority to alter the sorting process and element insertion positions. Implemented with a hybrid architecture of a one-dimension (1D) systolic array and shift registers, our design is validated through packet-level simulations for flow table timeout management. Results demonstrate that a 4K-depth, 16-bit timer queue achieves over 500 MHz (175 Mpps, 12 ns precision) in a 28nm process and over 300 MHz (116 Mpps) on an FPGA. Critically, it reduces LUTs and FFs usage by 31% and 25%, respectively, compared to existing designs.",
"arxiv_id": "2601.09081",
"authors": [
"Zekun Wang",
"Binghao Yue",
"Weitao Pan",
"Jianyi Shi",
"Yue Hao"
],
"categories": [
"cs.DS"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "A Grouped Sorting Queue Supporting Dynamic Updates for Timer Management in High-Speed Network Interface Cards",
"url": "https://arxiv.org/abs/2601.09081",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "34d790ef-eed8-4f0c-a2ff-184b67c2eafe",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}