Seminars

In the context of team Cornet’s seminars, Francesco De Pellegrini (LIA) will present his research work on Coflow Fair Scheduling via Dynamic Progress, on April 1, 2022, at 11:35 in the meeting room. Abstract : The average coflow completion time (CCT) is the standard performance metric in coflow scheduling. However, standard CCT minimization may introduce unfairness between the data transfer phase of different computing jobs. Static progress guarantees have been introduced in the literature to mitigate this fairness issue, but the trade-off between fairness and efficiency of data transfer seems hard to control. In this paper we introduce a new fairness framework for coflow scheduling based on the concept of slowdown to measure the performance degradation experienced by a coflow compared to isolation. This framework provides more flexible means to control the progress of coflows while minimizing the average CCT. We design an algorithmic solution chosen in the class of the sigma-order schedulers to solve the fair coflow scheduling problem in polynomial time. The algorithm is proved to be a 4-approximation w.r.t. an optimal scheduler. Our numerical results validate the proposed scheme and demonstrate that this approach can trade off average CCT for per-coflow slowdown.

In the context of team Cornet’s seminars, Rachid Elazouzi (LIA) will present his research work on Deadline-aware scheduling algorithm for coflows in datacenters, on March 3, 2022, at 11:35 in the meeting room.

In the context of team Cornet’s seminars, Julio Cesar (LIA) will present his research work on March 4, 2022, at 11:35 in the meeting room.

In the context of team Cornet’s seminars, Paolo Zappala (LIA/Orange) will present his research work on January 21, 2022, at 11:35 in the meeting room.

In the context of team Cornet’s seminars, Rachid Elazouzi (LIA) will present his research work on Coflow scheduling in data centers: Background and motivation, on December 17, 2021, at 11:35 in the meeting room.

In the context of team Cornet’s seminars, Michael Poss (LIRMM) will present his research work on Optimization problems in graphs with location uncertainty on November 26, 2021, at 11:35 in the meeting room. Abstract: Many discrete optimization problems amount to select a feasible subgraph of least weight. We consider in this paper the context of spatial graphs where the positions of the vertices are uncertain and belong to known uncertainty sets. The objective is to minimize the sum of the distances in the chosen subgraph for the worst positions of the vertices in their uncertainty sets. We will present some of the results we obtained for these problems, including a numerical illustration on Steiner tree problems.

In the context of team Cornet’s seminars, Mathilde Vernet (LIA) will present her work on Connectivity in Dynamic Graphs on November 12, 2021, at 11:35 in the meeting room.

In the context of team Cornet’s seminars, Mathilde Vernet (LIA) will present her research work on October 22, 2021, at 11:35 in the meeting room.