Related papers: Heavy traffic analysis for EDF queues with renegin…
We consider a two-queue polling model with switch-over times and $k$-limited service (serve at most $k_i$ customers during one visit period to queue $i$) in each queue. The major benefit of the $k$-limited service discipline is that it -…
We consider the scheduling of multiple tasks with pre-determined deadlines under random processing cost. This problem is motivated by the potential of large scale adoption of plug-in (hybrid) electric vehicles (PHEVs) in the near future.…
Datacenters are the main infrastructure on top of which cloud computing services are offered. Such infrastructure may be shared by a large number of tenants and applications generating a spectrum of datacenter traffic. Delay sensitive…
We consider a two-node tandem queueing network in which the upstream queue is GI/GI/1 and each job reuses its upstream service requirement when moving to the downstream queue. Both servers employ the first-in-first-out policy. To…
We consider a load balancing system comprised of a fixed number of single server queues, operating under the well-known Join-the-Shortest Queue policy, and where jobs/customers are impatient and abandon if they do not receive service after…
As edge computing expands, serving multiple deep neural network (DNN) models on a single shared GPU has become a common yet challenging scenario, where each scheduling decision affects the tail latency of all concurrent queues. Existing…
We consider the problem of scheduling a queueing system in which many statistically identical servers cater to several classes of impatient customers. Service times and impatience clocks are exponential while arrival processes are renewal.…
Systems in many safety-critical application domains are subject to certification requirements. In such a system, there are typically different applications providing functionalities that have varying degrees of criticality. Consequently,…
We study $n$ parallel queues in an extreme heavy-traffic regime: each server works at rate $n$, while jobs arrive to a dispatcher at rate $n^2-(a-b)\sqrt{n}$, with fixed $a>b>0$. Arrivals are routed by a marginal join-the-shortest-queue…
We study a single server FIFO queue that offers general service. Each of n customers enter the queue at random time epochs that are inde- pendent and identically distributed. We call this the random scattering traffic model, and the…
Multiserver jobs, which are jobs that occupy multiple servers simultaneously during service, are prevalent in today's computing clusters. But little is known about the delay performance of systems with multiserver jobs. We consider queueing…
We consider a discrete-time parallel service system consisting of $n$ heterogeneous single server queues with infinite capacity. Jobs arrive to the system as an i.i.d. process with rate proportional to $n$, and must be immediately…
The presented study elaborates a multi-server priority queueing model considering the pre-emptive repeat policy and phase-type distribution (PH) for retrial process. The incoming heterogeneous calls are categorized as handoff calls and new…
Optical switches have been drawing attention due to their large data bandwidth and low power consumption. However, scheduling policies need to account for the schedule reconfiguration delay of optical switches to achieve good performance.…
This paper examines the performance of multi-class multi-server bipartite queueing systems under a FCFS-ALIS service discipline, where each arriving customer is only compatible with a subset of servers. We analyze the system under…
We present a heavy traffic analysis of a single-server polling model, with the special features of retrials and glue periods. The combination of these features in a polling model typically occurs in certain optical networking models, and in…
A single-server queuing model is considered with customers that have deadlines. If a customer's deadline elapses before service is offered, the customer abandons the system (customers do not abandon while being served). When the server…
A many-server heavy-traffic FCLT is proved for the $G_t/M/s_t+\mathit {GI}$ queueing model, having time-varying arrival rate and staffing, a general arrival process satisfying a FCLT, exponential service times and customer abandonment…
In this paper I have study to Reduce the time Complexity of Earliest Deadline First (EDF), a global scheduling scheme for Earliest Deadline First in Real Time System tasks on a Multiprocessors system. Several admission control algorithms…
We consider a queue with renewal arrivals and n exponential servers in the Halfin-Whitt heavy traffic regime, where n and the arrival rate increase without bound, so that a critical loading condition holds. Server k serves at rate $\mu_k $,…