English
Related papers

Related papers: Uniform stability of some large-scale parallel ser…

200 papers

We study the concentration phenomenon for discrete-time random dynamical systems with an unbounded state space. We develop a heuristic approach towards obtaining exponential concentration inequalities for dynamical systems using an entirely…

Machine Learning · Statistics 2022-12-08 Muhammad Abdullah Naeem , Miroslav Pajic

A class of distributed systems with a cyclic interconnection structure is considered. These systems arise in several biochemical applications and they can undergo diffusion driven instability which leads to a formation of spatially…

Optimization and Control · Mathematics 2007-05-23 M. R. Jovanovic , M. Arcak , E. D. Sontag

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 corresponding stochastic processes are represented by…

Probability · Mathematics 2009-08-25 Christian H. Gromoll , Philippe Robert , Bert Zwart

Multi-server queueing systems are widely used models for job scheduling in machine learning, wireless networks, crowdsourcing, and healthcare systems. This paper considers a multi-server system with multiple servers and multiple types of…

Machine Learning · Computer Science 2023-06-05 Zixian Yang , R. Srikant , Lei Ying

We consider two-stage tandem queueing systems with one dedicated server in each station and a flexible server that can serve both stations. We assume exponential service times, linear holding costs accrued by jobs present in the system, and…

Systems and Control · Computer Science 2019-04-12 Ioannis Papachristos , Dimitrios G. Pandelis

A classical sampling strategy for load balancing policies is power-of-two, where any server pair is sampled with equal probability. This does not cover practical settings with assignment constraints which force non-uniform sampling. While…

Probability · Mathematics 2022-07-18 Ellen Cardinaels , Sem Borst , Johan S. H. van Leeuwaarden

We survey continuous-time generative modeling methods based on transporting a simple reference distribution to a data distribution via stochastic or deterministic dynamics. We present a unified framework in which diffusion models,…

Machine Learning · Computer Science 2026-05-11 Aditya Ranganath , Mukesh Singhal

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…

Probability · Mathematics 2015-10-29 Amber L. Puha

We establish a new class of functional central limit theorems for partial sum of certain symmetric stationary infinitely divisible processes with regularly varying L\'{e}vy measures. The limit process is a new class of symmetric stable…

Probability · Mathematics 2015-01-16 Takashi Owada , Gennady Samorodnitsky

Motivated by call center practice, we propose a tractable model for $\mbox{GI}/\mbox{GI}/n+\mbox{GI}$ queues in the efficiency-driven (ED) regime. We use a one-dimensional diffusion process to approximate the virtual waiting time process…

Probability · Mathematics 2015-09-17 Shuangchi He

We consider an infinite server queue where the arrival and the service rates are both modulated by a stochastic environment governed by an $S$-valued stochastic process $X$ that is ergodic with a limiting measure $\pi\in \mathcal{P}(S)$.…

Probability · Mathematics 2024-10-30 Abhishek Pal Majumder

In this paper, we present a condition to obtain instability for a class of queueing networks where the arrival rates in each server are constant and the departure rate in each server is a decreasing function of the queue lengths of other…

Probability · Mathematics 2023-08-01 Pierre Popineau , Seva Shneer

We investigate ergodic-theoretical quantities and large deviation properties of one-dimensional intermittent maps, that have not only an indifferent fixed point but also a singular structure such that the uniform measure is invariant under…

Chaotic Dynamics · Physics 2015-06-18 Soya Shinkai , Yoji Aizawa

We consider a stochastic queueing system modelling the behaviour of a wireless network with nodes employing a discrete-time version of the standard decentralised medium access algorithm. The system is {\em unsaturated} -- each node receives…

Networking and Internet Architecture · Computer Science 2018-03-21 Seva Shneer , Alexander Stolyar

A service system with multiple types of customers, arriving according to Poisson processes, is considered. The system is heterogeneous in that the servers also can be of multiple types. Each customer has an independent exponentially…

Probability · Mathematics 2016-05-20 Alexander Stolyar

We consider a single server system with infinite waiting room in a random environment. The service system and the environment interact in both directions. Whenever the environment enters a prespecified subset of its state space the service…

Probability · Mathematics 2013-12-03 Ruslan Krenzler , Hans Daduna

Motivated by queueing systems with heterogeneous parallel servers, we consider a class of structured multi-dimensional Markov processes whose state space can be partitioned into two parts: a finite set of boundary states and a structured…

Probability · Mathematics 2015-10-02 Jori Selen , Ivo J. B. F. Adan , Johan S. H. van Leeuwaarden

This paper presents a distributed model predictive control (DMPC) algorithm for heterogeneous vehicle platoons with unidirectional topologies and a priori unknown desired set point. The vehicles (or nodes) in a platoon are dynamically…

Optimization and Control · Mathematics 2018-03-19 Yang Zheng , Shengbo Eben Li , Keqiang Li , Francesco Borrelli , J. Karl Hedrick

We consider a system of $N$ parallel single-server queues with unit exponential service rates and a single dispatcher where tasks arrive as a Poisson process of rate $\lambda(N)$. When a task arrives, the dispatcher assigns it to a server…

In this work, we show that Latent Flow-Matching (LFM) models are robust to different types of perturbations, including data reduction and model capacity shrinkage. We characterize this stability by their tendency to generate similar outputs…

Machine Learning · Computer Science 2026-05-12 Rania Briq , Michael Kamp , Ohad Fried , Sarel Cohen , Stefan Kesselheim