Datacenter operations today provide a plethora of new queueing and scheduling problems.
The notion of a “job” has become more general and multi-dimensional. The ways in which …

Queueing delays are ubiquitous in many domains, including computer systems, service
systems, communication networks, supply chains, and transportation. Queueing and …

The performance of large-scale distributed compute systems is adversely impacted by
stragglers when the execution time of a job is uncertain. To manage stragglers, we consider …

A fork–join system with Pareto service time distribution is considered as a model of a parallel
structure of data processing. For an approximation of the mean response time of the system …

Modern data centers are tasked with processing heterogeneous workloads consisting of
various classes of jobs. These classes differ in their arrival rates, size distributions, and job …

Problem definition: Cloud computing is recognized as a critical driver of information
technology–enabled innovations. The operations management (OM) community, however …

This paper investigates the fork-join scheduling scheme on a system of n parallel servers
comprising both slow and fast servers. Tasks arriving in the system are divided into k sub …

In this paper, we study systems where each job or request can be split into a flexible number
of sub-jobs up to a maximum limit. The number of sub-jobs a job is split into depends on the …

Zero queueing delay is highly desirable in large-scale computing systems. Existing work has
shown that it can be asymptotically achieved by using the celebrated Power-of-d-choices …

The interaction between projects and servers has grown significantly in complexity; thus,
applying parallel calculations increases dramatically. However, it should not be ignored that …