We present Sincronia, a near-optimal network design for coflows that can be implemented
on top on any transport layer (for flows) that supports priority scheduling. Sincronia achieves …

Applications designed for data-parallel computation frameworks such as MapReduce
usually alternate between computation and communication stages. Coflow scheduling is a …

This paper addresses a complex parallel machine scheduling problem with jobs divided into
operations and operations grouped in families. Non-anticipatory family setup times are held …

The coflow scheduling problem has emerged as a popular abstraction in the last few years
to study data communication problems within a data center [6]. In this basic framework, each …

Finding an optimal/near-optimal scheduling algorithm to minimize the age of information
(AoI) in a multi-source G/G/1 system is well-known to be a hard problem, more so if there is a …

Training a neural network requires retraining the same model many times to search for the
configuration of hyper-parameters with the best training result. It is common to launch …

We consider the matroid coflow scheduling problem, where each job is comprised of a set of
flows and the family of sets that can be scheduled at any time form a matroid. Our main result …

We consider the matroid intersection cover problem. This is a special case of set cover
where the sets are derived from the intersection of matroids. We introduce a technique for …

We study task scheduling and offloading in a cloud computing system with multiple users
where tasks have different processing times, release times, communication times, and …

Nowadays, the distributed key-value stores have become the basic building block for large-
scale cloud applications. In large-scale distributed key-value stores, many key-value access …