Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Puha, Amber L."'
Autor:
Ji, Chunxu, Puha, Amber L.
We prove a heavy traffic scaling limit for a shortest remaining processing time queue. We are interested in the case where the processing time distribution has a tail that decays rapidly, i.e., has light tails. In particular, we revisit the work in P
Externí odkaz:
http://arxiv.org/abs/2311.02680
We formulate a control problem for a GI/GI/N+GI queue, whose objective is to trade off the long-run average operational costs (i.e., abandonment costs and holding costs) with server utilization costs. To solve the control problem, we consider an asym
Externí odkaz:
http://arxiv.org/abs/2106.11407
Autor:
Aldous, David, Caputo, Pietro, Durrett, Rick, Holroyd, Alexander E., Jung, Paul, Puha, Amber L.
Thomas Milton Liggett was a world renowned UCLA probabilist, famous for his monograph Interacting Particle Systems. He passed away peacefully on May 12, 2020. This is a perspective article in memory of both Tom Liggett the person and Tom Liggett the
Externí odkaz:
http://arxiv.org/abs/2008.03137
Publikováno v:
Annals of Applied Probability, 32:4, 2587-2651, 2022
We study a single server queue operating under the shortest remaining processing time (SRPT) scheduling policy; that is, the server preemptively serves the job with the shortest remaining processing time first. In this work we are interested in study
Externí odkaz:
http://arxiv.org/abs/2003.03655
Autor:
Ji, Chunxu, Puha, Amber L.
Publikováno v:
Queueing Systems; Mar2025, Vol. 109 Issue 1, p1-58, 58p
Autor:
Puha, Amber L.
Publikováno v:
Annals of Applied Probability 2015, Vol. 25, No. 6, 3381-3404
We develop a heavy traffic diffusion limit theorem under nonstandard spatial scaling for the queue length process in a single server queue employing shortest remaining processing time (SRPT). For processing time distributions with unbounded support,
Externí odkaz:
http://arxiv.org/abs/1407.3837
Autor:
Jennings, Otis B., Puha, Amber L.
Publikováno v:
Stochastic Systems, 2013, Vol. 3, No. 1, 262-321
We consider an overloaded multiclass nonidling first-in-first-out single-server queue with abandonment. The interarrival times, service times, and deadline times are sequences of independent and identically, but generally distributed random variables
Externí odkaz:
http://arxiv.org/abs/1210.0959
Publikováno v:
Stochastic Systems, 1:1-16, 2011
We present a heavy traffic analysis for a single server queue with renewal arrivals and generally distributed i.i.d. service times, in which the server employs the Shortest Remaining Processing Time (SRPT) policy. Under typical heavy traffic assumpti
Externí odkaz:
http://arxiv.org/abs/1005.1035
Autor:
Puha, Amber L., Williams, Ruth J.
Publikováno v:
Annals of Applied Probability 2004, Vol. 14, No. 2, 517-554
This paper contains an asymptotic analysis of a fluid model for a heavily loaded processor sharing queue. Specifically, we consider the behavior of solutions of critical fluid models as time approaches \infty. The main theorems of the paper provide s
Externí odkaz:
http://arxiv.org/abs/math/0405289
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.