English
Related papers

Related papers: Tail Quantile Estimation for Non-preemptive Priori…

200 papers

In this paper, by the singular-perturbation technique, we investigate the heavy-traffic behavior of a priority polling system consisting of three M/M/1 queues with threshold policy. It turns out that the scaled queue-length of the…

Probability · Mathematics 2014-08-20 Zaiming Liu , Yuqing Chu , Jinbiao Wu

In this study, we consider multi-class multi-server asymmetric queueing systems consisting of $N$ queues on one side and $K$ servers on the other side, where jobs randomly arrive in queues at each time. The service rate of each job-server…

Machine Learning · Statistics 2025-05-07 Jung-hun Kim , Min-hwan Oh

We present a new framework for designing nonpreemptive and job-size oblivious scheduling policies in the multiserver-job queueing model. The main requirement is to identify a static and balanced sub-partition of the server set and ensure…

Performance · Computer Science 2025-02-04 Jonatha Anselmi , Josu Doncel

When a computer system schedules jobs there is typically a significant cost associated with preempting a job during execution. This cost can be from the expensive task of saving the memory's state and loading data into and out of memory. It…

Data Structures and Algorithms · Computer Science 2018-03-01 Giorgio Lucarelli , Benjamin Moseley , Nguyen Kim Thang , Abhinav Srivastav , Denis Trystram

We introduce the first class of perfect sampling algorithms for the steady-state distribution of multi-server queues with general interarrival time and service time distributions. Our algorithm is built on the classical dominated coupling…

Probability · Mathematics 2015-08-11 Jose Blanchet , Jing Dong , Yanan Pei

Let $(X_n:n\geq 0)$ be a sequence of i.i.d. r.v.'s with negative mean. Set $S_0=0$ and define $S_n=X_1+... +X_n$. We propose an importance sampling algorithm to estimate the tail of $M=\max \{S_n:n\geq 0\}$ that is strongly efficient for…

Probability · Mathematics 2008-08-21 Jose Blanchet , Peter Glynn

We consider a discrete-time system comprising a first-come-first-served queue, a non-preemptive server, and a stationary non-work-conserving scheduler. New tasks enter the queue according to a Bernoulli process with a pre-specified arrival…

Applications · Statistics 2020-08-05 Michael Lin , Nuno C. Martins , Richard J. La

The present article is devoted to the semi-parametric estimation of multivariate expectiles for extreme levels. The considered multivariate risk measures also include the possible conditioning with respect to a functional covariate,…

Statistics Theory · Mathematics 2023-03-30 Elena Di Bernardino , Thomas Laloë , Cambyse Pakzad

This paper addresses computational challenges in estimating Quantile Regression with Selection (QRS). The estimation of the parameters that model self-selection requires the estimation of the entire quantile process several times. Moreover,…

Econometrics · Economics 2024-02-27 Santiago Pereda-Fernández

In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of its performances. We concentrate on the logarithmic tail…

Probability · Mathematics 2007-05-23 Marc Lelarge

A multi-class single-server queueing model with finite buffers, in which scheduling and admission of customers are subject to control, is studied in the moderate deviation heavy traffic regime. A risk-sensitive cost set over a finite time…

Probability · Mathematics 2018-05-02 Rami Atar , Asaf Cohen

We introduce contextual queueing bandits, a new context-aware framework for scheduling while simultaneously learning unknown service rates. Individual jobs carry heterogeneous contextual features, based on which the agent chooses a job and…

Machine Learning · Computer Science 2026-05-19 Seoungbin Bae , Garyeong Kang , Dabeen Lee

Two independent Poisson streams of jobs flow into a single-server service system having a limited common buffer that can hold at most one job. If a type-i job (i=1,2) finds the server busy, it is blocked and routed to a separate type-i…

Discrete Mathematics · Computer Science 2012-06-26 Konstantin Avrachenkov , Philippe Nain , Uri Yechiali

We consider a system with N unit-service-rate queues in tandem, with exogenous arrivals of rate lambda at queue 1, under a back-pressure (MaxWeight) algorithm: service at queue n is blocked unless its queue length is greater than that of…

Probability · Mathematics 2010-02-23 Alexander Stolyar

This paper studies the effect of an overdispersed arrival process on the performance of an infinite-server system. In our setup, a random environment is modeled by drawing an arrival rate $\Lambda$ from a given distribution every $\Delta$…

Probability · Mathematics 2016-02-02 Mariska Heemskerk , Johan van Leeuwaarden , Michel Mandjes

We obtain asymptotic bounds for the tail distribution of steady-state waiting time in a two server queue where each server processes incoming jobs at a rate equal to the rate of their arrivals (that is, the half-loaded regime). The job…

Probability · Mathematics 2016-04-05 Jose Blanchet , Karthyek Murthy

In many applications, significant correlations between arrivals of load-generating events make the numerical evaluation of the load of a system a challenging problem. Here, we construct very accurate approximations of the workload…

Probability · Mathematics 2014-05-02 Eleni Vatamidou , Ivo J. B. F. Adan , Maria Vlasiou , Bert Zwart

Explicit and exact results are obtained for the joint queue-length distribution for the two-level non-preemptive Markovian priority queue. Marginal distributions are derived for the general multi-level problem. The results are based on a…

Probability · Mathematics 2023-12-08 Josef Zuk , David Kirszenblat

Rare events in molecular dynamics are often related to noise-induced transitions between different macroscopic states (e.g., in protein folding). A common feature of these rare transitions is that they happen on timescales that are on…

Probability · Mathematics 2026-01-06 Carsten Hartmann , Annika Jöster , Christof Schütte , Alexander Sikorski , Marcus Weber

We consider a multi-server queue in the Halfin-Whitt regime: as the number of servers $n$ grows without a bound, the utilization approaches 1 from below at the rate $\Theta(1/\sqrt{n})$. Assuming that the service time distribution is…

Probability · Mathematics 2008-03-19 David Gamarnik , Petar Momcilovic
‹ Prev 1 3 4 5 6 7 10 Next ›