Sciweavers

734 search results - page 24 / 147
» Multiprocess Time Queue
Sort
View
SPDP
1991
IEEE
14 years 3 days ago
Optimal randomized algorithms for multipacket and cut through routing on the mesh
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...
Sanguthevar Rajasekaran, Mukund Raghavachari
QEST
2009
IEEE
14 years 3 months ago
A Performance Model of Zoned Disk Drives with I/O Request Reordering
—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...
QUESTA
2006
103views more  QUESTA 2006»
13 years 8 months ago
Heavy Tails in Multi-Server Queue
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...
Serguei Foss, Dmitry Korshunov
RTAS
2008
IEEE
14 years 3 months ago
Throttling On-Disk Schedulers to Meet Soft-Real-Time Requirements
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...
SIGMETRICS
2010
ACM
122views Hardware» more  SIGMETRICS 2010»
13 years 7 months ago
Heavy-traffic limits for nearly deterministic queues
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...
Karl Sigman, Ward Whitt