Sciweavers

6 search results - page 1 / 2
» Sojourn time distributions in the queue defined by a general...
Sort
View
QUESTA
2006
80views more  QUESTA 2006»
13 years 5 months ago
Sojourn time distributions in the queue defined by a general QBD process
We consider a general QBD process as defining a FIFO queue and obtain the stationary distribution of the sojourn time of a customer in that queue as a matrix exponential distribut...
Toshihisa Ozawa
QUESTA
2007
117views more  QUESTA 2007»
13 years 4 months ago
Analyzing a degenerate buffer with general inter-arrival and service times in discrete time
We present the queueing analysis of a degenerate buffer having access to a single server. This system cannot realize any given delay, but only values that are an integer multiple ...
Wouter Rogiest, Koenraad Laevens, Joris Walraevens...
SIGMETRICS
2010
ACM
115views Hardware» more  SIGMETRICS 2010»
12 years 12 months ago
The average response time in a heavy-traffic srpt queue
Shortest Remaining Processing Time first (SRPT) has long been known to optimize the queue length distribution and the mean response time (a.k.a. flow time, sojourn time). As such,...
Minghong Lin, Adam Wierman, Bert Zwart
CJ
2010
131views more  CJ 2010»
13 years 2 months ago
Turning Back Time - What Impact on Performance?
Consistent with the divide-and-conquer approach to problem solving, a recursive result is presented in the domain of stochastic modelling that derives product-form solutions for t...
Peter G. Harrison
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
13 years 5 months ago
Bound analysis of closed queueing networks with workload burstiness
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
Giuliano Casale, Ningfang Mi, Evgenia Smirni