Current superscalar architectures inherently depend on an instruction issue queue to achieve multiple instruction issue and out-oforder execution. However, the issue queue is implemented as a centralized structure and mainly causes globally broadcasting operations to wake up and select the instructions. Therefore, a large issue queue ultimately results in a low clock rate along with a high circ...

We treat a single–server vacation queue with queue–length dependent vacation schedules. This subsumes the single–server vacation queue with exhaustive service discipline and the vacation queue with Bernoulli schedule as special cases. The lengths of vacation times depend on the number of customers in the system at the beginning of a vacation. The arrival process is a batch–Markovian arrival pro...

This study aims to determine the transient behavior of blended queue. Priority customers arrive over time and benefit from a threshold reservation policy, while non-priority ones can be contacted at any time. We show how compute Laplace transforms probabilities. Using uniformization technique, we prove some monotonicty properties expected number in queue, explaining why optimal should lower tha...

A virtual queue can be used to predict when a real queue is about to grow. This memo explains why using a leaky bucket to implement a virtual queue is not useful, despite a superficial similarity. However, it is possible to implement a useful virtual queue using two leaky buckets. It requires a simple trick that can typically be implemented with existing hardware.