In recent years, a number of models involving different compatibilities between jobs and
servers in queueing systems, or between agents and resources in matching systems, have …

Datacenter operators today strive to support microsecond-latency applications while also
using their limited CPU resources as efficiently as possible. To achieve this, several recent …

With the proliferation of Internet of Things (IoT), zillions of bytes of data are generated at the
network edge, incurring an urgent need to push the frontiers of artificial intelligence (AI) to …

In large-scale computer systems, deciding how to dispatch arriving jobs to servers is a
primary factor affecting system performance. Consequently, there is a wealth of literature on …

Using redundancy to minimize latency in parallel server systems has become very popular
in recent years. While there are several variants of a redundancy-based system, the general …

Load balancing plays a crucial role in achieving low latency in large distributed systems.
Recent load balancing strategies often rely on replication or use placeholders to further …

Motivated by recent work on scheduling with predicted job sizes, we consider the
performance of scheduling algorithms with minimal advice, namely a single bit. The analysis …

We investigate the stability condition of redundancy-d multiserver systems. Each server has
its own queue and implements popular scheduling disciplines such as first-come-first-serve …

This paper studies load balancing for many‐server (N servers) systems. Each server has a
buffer of size b− 1, and can have at most one job in service and b− 1 jobs in the buffer. The …

In this article, we consider a load balancing protocol based on the power of random choices
that is adapted to a fog deploy in which several independent fog nodes equipped with a set …