A Neat Linked Queue with the Rear Blank Node
Xie Xie

TL;DR
This paper presents a simplified linked queue implementation using a rear blank node, reducing operational steps and enhancing performance, especially in real-time systems, and extends it to circular queues and deques.
Contribution
Introduces a novel linked queue design with a rear blank node that simplifies operations and improves efficiency, extending to circular queues and lazy variants.
Findings
Reduces dequeue operation steps in linked queues.
Extends the design to circular queues and deques.
Improves performance in real-time systems.
Abstract
We introduce a very simple queue implementation with the singly linked list. With the help of the rear blank node instead of the usual header node, we avoid additional check steps for the dequeue operation in the traditional implementations existing for many decades. The essence of our representation is the half-opened pointer interval with the same direction of the queue operations, which can guarantee the uniform treatment even in the empty queue case. The simplification of queue implementations cuts off unnecessary steps, and it minimizes the number of steps in the dequeue operation with the time limitation of enqueue operation, which could contribute to the performance of the real-time systems. We extend the linked queue to the circularly linked queue, which can also be used to implement stack and take advantage of the maximal information of the single direction in the circularly…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Distributed systems and fault tolerance · Advanced Queuing Theory Analysis
