Related papers: Parallel queues with synchronization
In Internet environment, traffic flow to a link is typically modeled by superposition of ON/OFF based sources. During each ON-period for a particular source, packets arrive according to a Poisson process and packet sizes (hence service…
Consider a system of identical server pools where tasks with exponentially distributed service times arrive as a time-inhomogenenous Poisson process. An admission threshold is used in an inner control loop to assign incoming tasks to server…
We investigate the stability condition of redundancy-$d$ multi-server systems. Each server has its own queue and implements popular scheduling disciplines such as First-Come-First-Serve (FCFS), Processor Sharing (PS), and Random Order of…
Modern data centers serve workloads which are capable of exploiting parallelism. When a job parallelizes across multiple servers it will complete more quickly, but jobs receive diminishing returns from being allocated additional servers.…
In many different settings, requests for service can arrive in near or true simultaneity with one another. This creates batches of arrivals to the underlying queueing system. In this paper, we study the staffing problem for the batch…
We consider many-server queueing systems with heterogeneous exponential servers and renewal arrivals. The service rate of each server is a random variable drawn from a given distribution. We develop a framework for analyzing the heavy…
Motivated by demand prediction for the custodial prison population in England and Wales, this paper describes an approach to the study of service systems using infinite server queues, where the system has non-empty initial state and the…
This paper provides a mathematical framework for estimation of the service time distribution and the expected service time of an infinite-server queueing system with a nonhomogeneous Poisson arrival process, in the case of partial…
This paper purpose is to investigate exponential behavior conditions for the infinite servers queue with Poisson arrivals busy period length distribution. It is presented a general theoretical result that is the basis of this work. The…
Burke's theorem can be seen as a fixed-point result for an exponential single-server queue; when the arrival process is Poisson, the departure process has the same distribution as the arrival process. We consider extensions of this result…
Using a result of Blanchet and Wallwater (2015: Exact sampling of stationary and time-reversed queues. ACM TOMACS, 25, 26) for exactly simulating the maximum of a negative drift random walk queue endowed with independent and identically…
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…
Algorithms for scheduling structured parallel computations have been widely studied in the literature. For some time now, Work Stealing is one of the most popular for scheduling such computations, and its performance has been studied in…
In this article, we study the classical shortest queue problem under the influence of malicious attacks, which is relevant to a variety of engineering system including transportation, manufacturing, and communications. We consider a…
We study the performance of random linear network coding for time division duplexing channels with Poisson arrivals. We model the system as a bulk-service queue with variable bulk size. A full characterization for random linear network…
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…
In the context of load balancing, Lu et al. introduced the distributed Join-Idle-Queue algorithm, where a group of dispatchers distribute jobs to a cluster of parallel servers. Each dispatcher maintains a queue of idle servers; when a job…
As job redundancy has been recognized as an effective means to improve performance of large-scale computer systems, queueing systems with redundancy have been studied by various authors. Existing results include methods to compute the queue…
Parallel batched data structures are designed to process synchronized batches of operations in a parallel computing model. In this paper, we propose parallel combining, a technique that implements a concurrent data structure from a parallel…
Task replication has recently been advocated as a practical solution to reduce latencies in parallel systems. In addition to several convincing empirical studies, some others provide analytical results, yet under some strong assumptions…