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 …

Modern parallel platforms, such as clouds or servers, are often shared among many different
jobs. However, existing parallel programming runtime systems are designed and optimized …

To keep pace with Moore's law, chip designers have focused on increasing the number of
cores per chip rather than single core performance. In turn, modern jobs are often designed …

Modern data centers serve workloads which can exploit parallelism. When a job parallelizes
across multiple servers it completes more quickly. However, it is unclear how to share a …

Many algorithms have been proposed to efficiently schedule parallel jobs on a multicore
and/or multiprocessor machine to minimize average flow time, and the complexity of the …

To keep pace with Moore's law, chip designers have focused on increasing the number of
cores per chip. To effectively leverage these multi-core chips, one must decide how many …

Modern production data processing and machine learning pipelines on the cloud are critical
components for many cloud-based companies. These pipelines are typically composed of …

We consider online scheduling. on m identical processors. Jobs are parallel programs
constructed using dynamic multithreading (also called fork-join parallelism). Jobs arrive over …

Speed Scaling with Multiple Servers under a Sum-Power Constraint Page 1 Speed Scaling
with Multiple Servers under a Sum-Power Constraint Rahul Vaze⇤ School of Technology and …

Large data centers composed of many servers provide the opportunity to improve
performance by parallelizing jobs. However, effectively exploiting parallelism is non-trivial …