Abstract. We consider a two-priority, preemptive, single-server queueing model. Each customer is classified into either a high priority class or a low priority class. The arrivals of the two priority classes follow independent Poisson processes and service time is assumed to be exponentially distributed. A queue-length-cutoff method is considered. Under this discipline the server responds only ...

This paper presents a novel SRAM-based architecture of data structure that represents set multiple priority queues can be implemented in FPGA or ASIC. The proposed is based on shift registers, systolic arrays and SRAM memories. Such architecture, called MultiQueue, optimized for minimum chip area costs, which leads to lower energy consumption too. MultiQueue has constant time complexity, critic...

We present a practical meldable priority queue implementation. All priority queue operations are very simple and their logarithmic time bound holds with high probability, which makes this data structure more suitable for real-time applications than those with only amortized performance guarantees. Our solution is also space-eecient, since it does not require storing any auxiliary information wi...

In this paper we consider a single-server polling system with switch-over times. We introduce a new service discipline, mixed gated/exhaustive service, that can be used for queues with two types of customers: high and low priority customers. At the beginning of a visit of the server to such a queue, a gate is set behind all customers. High priority customers receive priority in the sense that t...

A priority queue plays an important role in stochastic discrete event simulations for as much as 40% of a simulation execution time is consumed by the pending event set management. This article describes a new form of tree-based priority queues which employs the demarcation procedure to systematically split a single tree-based priority queue into many smaller trees, each divided by a logical ti...