Sciweavers

10 search results - page 2 / 2
» Heavy Tails in Multi-Server Queue
Sort
View
INFOCOM
2003
IEEE
13 years 11 months ago
Heavy tailed M/G/1-PS queues with impatience and admission control in packet networks
Abstract—In this paper we analyze the M/G/1 processor sharing queue with heavy tailed services and with impatient customers. It is assumed that impatience depends on the value of...
Jacqueline Boyer, Fabrice Guillemin, Philippe Robe...
QUESTA
2011
12 years 8 months ago
Uniform approximations for the M/G/1 queue with subexponential processing times
: This paper studies the asymptotic behavior of the steady-state waiting time, W∞, of the M/G/1 queue with subexponenential processing times for different combinations of traffi...
Mariana Olvera-Cravioto, Peter W. Glynn
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 5 months ago
Heavy-Tailed Limits for Medium Size Jobs and Comparison Scheduling
We study the conditional sojourn time distributions of processor sharing (PS), foreground background processor sharing (FBPS) and shortest remaining processing time first (SRPT) s...
Predrag R. Jelenkovic, Xiaozhu Kang, Jian Tan
WOSP
2000
ACM
13 years 10 months ago
Analytic modeling of load balancing policies for tasks with heavy-tailed distributions
We present an analytic technique for modeling load balancing policies on a cluster of servers conditioned on the fact that the service times of arriving tasks are drawn from heavy...
Alma Riska, Evgenia Smirni, Gianfranco Ciardo
IPPS
2006
IEEE
13 years 11 months ago
Modelling job allocation where service duration is unknown
In this paper a novel job allocation scheme in distributed systems (TAG) is modelled using the Markovian process algebra PEPA. This scheme requires no prior knowledge of job size ...
Nigel Thomas