Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
442
The impact of reneging in processor sharing queues
- ACM-Sigmetrics (Saint Malo), ACM/IFIP WG
, 2006
"... We investigate an overloaded processor sharing queue with renewal arrivals and generally distributed service times. Im-patient customers may abandon the queue, or renege, be-fore completing service. The random time representing a customer’s patience has a general distribution and may be dependent on ..."
Abstract
-
Cited by 10 (3 self)
- Add to MetaCart
We investigate an overloaded processor sharing queue with renewal arrivals and generally distributed service times. Im-patient customers may abandon the queue, or renege, be-fore completing service. The random time representing a customer’s patience has a general distribution and may be dependent
Predicting response times in processor-sharing queues
- In Proc. of the Fields Institute Conf. on Comm. Networks
, 2000
"... Abstract. We investigate the possibility of reliably predicting response times in real time (e.g., at the time a job arrives) in the M/G/1 processor-sharing queue. The proposed prediction is the conditional mean given current state information. We consider several forms of state information, always ..."
Abstract
-
Cited by 15 (2 self)
- Add to MetaCart
Abstract. We investigate the possibility of reliably predicting response times in real time (e.g., at the time a job arrives) in the M/G/1 processor-sharing queue. The proposed prediction is the conditional mean given current state information. We consider several forms of state information, always
Fluid Limits for Processor Sharing Queues with Impatience
- in "Mathematics of Operation Research", To Appear, 2007. Publications in Conferences and Workshops
"... Abstract. We investigate a processor sharing queue with renewal arrivals and generally distributed service times. Impatient jobs may abandon the queue, or renege, before completing service. The random time representing a job’s patience has a general distribution and may be dependent on its initial s ..."
Abstract
-
Cited by 17 (6 self)
- Add to MetaCart
Abstract. We investigate a processor sharing queue with renewal arrivals and generally distributed service times. Impatient jobs may abandon the queue, or renege, before completing service. The random time representing a job’s patience has a general distribution and may be dependent on its initial
Asymptotic bounds for M X /G/1 processor sharing queues
, 2003
"... This paper analyzed the asymptotic bounds of anM=G=1 processor sharing queue with bulk arrivals. 1 ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
This paper analyzed the asymptotic bounds of anM=G=1 processor sharing queue with bulk arrivals. 1
Fluid Approximations for a Processor-sharing Queue
, 1996
"... This paper studies the fluid approximation, also known as the functional strong lawof -large-numbers, for a GI/G/1 queue under a processor-sharing service discipline. The fluid (approximation) limit in general depends on the service time distribution, and the convergence is in general in the Skoroho ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
This paper studies the fluid approximation, also known as the functional strong lawof -large-numbers, for a GI/G/1 queue under a processor-sharing service discipline. The fluid (approximation) limit in general depends on the service time distribution, and the convergence is in general
Sample-Path Large Deviations for Generalized Processor Sharing Queues with Gaussian Inputs
, 2003
"... Sample-path large deviations for generalized processor sharing queues with Gaussian inputs M.R.H. Mandjes, M.J.G. van Uitert ..."
Abstract
- Add to MetaCart
Sample-path large deviations for generalized processor sharing queues with Gaussian inputs M.R.H. Mandjes, M.J.G. van Uitert
A Note on the Event Horizon for a Processor Sharing Queue ∗
, 2008
"... In this note we identify a phenomenon for processor sharing queues that is unique to ones with time-varying rates. This property was discovered while correcting a proof in Hampshire, Harchol-Balter and Massey [5]. If the arrival rate for processor sharing queue has unbounded growth over time, then i ..."
Abstract
- Add to MetaCart
In this note we identify a phenomenon for processor sharing queues that is unique to ones with time-varying rates. This property was discovered while correcting a proof in Hampshire, Harchol-Balter and Massey [5]. If the arrival rate for processor sharing queue has unbounded growth over time
Results 1 - 10
of
442
