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...
: 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...
We study the conditional sojourn time distributions of processor sharing (PS), foreground background processor sharing (FBPS) and shortest remaining processing time first (SRPT) s...
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...
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 ...