In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
—Disk drives are a common performance bottleneck in modern storage systems. To alleviate this, disk manufacturers employ a variety of I/O request scheduling strategies which aim ...
Abigail S. Lebrecht, Nicholas J. Dingle, William J...
Abstract. In this paper, the asymptotic behaviour of the distribution tail of the stationary waiting time W in the GI/GI/2 FCFS queue is studied. Under subexponential-type assumpti...
To achieve better throughput, many hard drive manufacturers use internal queues and scheduling to take advantage of vendor-specific characteristics and knowledge. While this tren...
Mark J. Stanovich, Theodore P. Baker, An-I Andy Wa...
We establish heavy-traffic limits for nearly deterministic queues, such as the G/D/n many-server queue. Since waiting times before starting service in the G/D/n queue are equivale...