The week's events
-
Polaris-tt: Rémi Castera - Statistical discrimination in Stable Matchings
Polaris-tt: Rémi Castera - Statistical discrimination in Stable Matchings
–
April 14, 2022
-
News
- Journée au vert POLARIS 2022/05/23
- DATAMOVE/POLARIS picnic 2021/06/22
- DATAMOVE/POLARIS BBQ 2019 2019/06/14
- POLARIS Bootcamp (May 2019) 2019/05/24
- slides of Andras Gyorgy 2016/01/15
Next seminars
Events
Events in April–May 2022
MMonday TTuesday WWednesday TThursday FFriday SSaturday SSunday 28March 28, 202229March 29, 202230March 30, 2022Seminar Bertrand Simon (An Exact Algorithm for the Linear Tape Scheduling Problem)
–
March 31, 2022Title: An Exact Algorithm for the Linear Tape Scheduling Problem
Abstract: Magnetic tapes are often considered as an outdated storage technology, yet they are still used to store huge amounts of data. Their main interests are a large capacity and a low price per gigabyte, which come at the cost of a much larger file access time than on disks. With tapes, finding the right ordering of multiple file accesses is thus key to performance. Moving the reading head back and forth along a kilometer long tape has a non-negligible cost and unnecessary movements thus have to be avoided. However, the optimization of tape request ordering has then rarely been studied in the scheduling literature, much less than I/O scheduling on disks. For instance, minimizing the average service time for several read requests on a linear tape remains an open question. Therefore, in this paper, we aim at improving the quality of service experienced by users of tape storage systems, and not only the peak performance of such systems. To this end, we propose a reasonable polynomial-time exact algorithm while this problem and simpler variants have been conjectured NP-hard. We also refine the proposed model by considering U-turn penalty costs accounting for inherent mechanical accelerations. Then, we propose a low-cost variant of our optimal algorithm by restricting the solution space, yet still yielding an accurate suboptimal solution. Finally, we compare our algorithms to existing solutions from the literature on logs of the mass storage management system of a major datacenter. This allows us to assess the quality of previous solutions and the improvement achieved by our low-cost algorithm. Aiming for reproducibility, we make available the complete implementation of the algorithms used in our evaluation, alongside the dataset of tape requests that is, to the best of our knowledge, the first of its kind to be publicly released.
April
1April 1, 20222April 2, 20223April 3, 20224April 4, 20225April 5, 20226April 6, 2022Polaris-tt: Achile Baucher: le modèle World3
–
April 7, 20228April 8, 20229April 9, 202210April 10, 202211April 11, 202212April 12, 202213April 13, 2022Polaris-tt: Rémi Castera - Statistical discrimination in Stable Matchings
–
April 14, 202215April 15, 202216April 16, 202217April 17, 202218April 18, 202219April 19, 202220April 20, 202221April 21, 202222April 22, 202223April 23, 202224April 24, 202225April 25, 202226April 26, 202227April 27, 2022Polaris-tt: Victor Leger – A large dimensional analysis of multi-task semi-supervised classification
–
April 28, 2022Seminar by Martin Schreiber (LJK, Airsea)
–
April 28, 2022Title: A Brief Glimpse on Emerging Time Integration Methods for Weather and Climate Simulations
Speaker: Martin Schreiber
Abstract:
Weather and climate simulations face new challenges due to changes in computer architectures caused by physical limitations. From a pure computing perspective, algorithms are required to cope with stagnating or even decreasing per-core speed and increasing on-chip parallelism. These trends will continue and already led to research on partly disruptive mathematical and algorithmic reformulations of dynamic cores, e.g., using (additional) parallelism along the time dimension.
This presentation provides an overview and introduction of a variety of promising newly developed and evaluated time integration methods for equations related to prototypical dynamical cores, all aimed at improving the ratio of wall clock time vs. error: Rational Approximation of Exponential Integration (REXI), Parallel Full Approximation Scheme in Space and Time (PFASST) and Semi-Lagrangian methods combined with Parareal. We get improved time-vs.-error rates, but sometimes with additional challenges on the way which needs to be further overcome. Overall, our results motivate further investigation and combination of these methods for operational weather/climate systems.
I gratefully acknowledge collaborators related to this presentation
Jed Brown, Finn Capelle, François Hamon, Terry Haut, Richard Loft, Michael Minion, Matthew Normile, Nathanael Schaeffer, Andreas Schmitt, Pedro S. Peixoto, Raphael Schilling29April 29, 202230April 30, 2022May
1May 1, 20222May 2, 20223May 3, 20224May 4, 2022Polaris-tt: Hugo Lebeau – A random matrix analysis of kernel-based online learning: coping with limited memory resources
–
May 5, 2022Polaris-datamove Seminar: Jonatha Anselmi (Title: Recent advances in load balancing: replication, speculation and auto-scaling)
–
May 5, 2022Title: Recent advances in load balancing: replication, speculation and auto-scalingAbstract: In this talk, we will discuss modern approaches for load balancing in large-scale parallel-server systems: replication, speculation and auto-scaling. Replication sends multiple copies of a given job, simultaneously upon its arrival, to multiple servers and then uses the results from whichever copy responds first. Speculation sends one or multiple copies of a given job only once the system smartly detects it as a "straggler", i.e., as a job taking longer than expected to complete because of some unfortunate runtime phenomenon. Auto-scaling allows the net service capacity, or overall number of servers, to scale up or down in response to the current load and within the same timescale of job dynamics. We will review the state of the art and present some recent results in the flavour of mean-field and fluid limit theorems.
6May 6, 20227May 7, 20228May 8, 20229May 9, 202210May 10, 202211May 11, 2022Workshop d'axe
–
May 12, 202213May 13, 202214May 14, 202215May 15, 202216May 16, 202217May 17, 202218May 18, 2022Polaris-tt: Henry-Joseph Audeoud (title to be annouced)
–
May 19, 202220May 20, 202221May 21, 202222May 22, 202223May 23, 202224May 24, 202225May 25, 202226May 26, 202227May 27, 202228May 28, 202229May 29, 202230May 30, 202231May 31, 2022June
1June 1, 2022Séminaire Michel Davydov: "Proving the Poisson Hypothesis for Replica-Mean-Field Models"
–
June 2, 2022Title : Proving the Poisson Hypothesis for Replica-Mean-Field ModelsAbstract :
Modeling particles or agents as nodes of a network interacting over time is a common approach in a variety of fields. Unfortunately, most relevant dynamics involve complex graphs of interactions for which an exact computational treatment is impossible. To circumvent this difficulty, the replica-mean-field approach focuses on randomly interacting replicas of the networks of interest. In the limit of an infinite number of replicas, these networks become analytically tractable under the so-called Poisson Hypothesis, which postulates that replicas become asymptotically independent and arrivals to a given neuron become Poisson distributed. This hypothesis is often conjectured or numerically validated but not proven. We show the validity of the Poisson Hypothesis for large classes of processes that include for example Galves-Löcherbach models from computational neuroscience.3June 3, 20224June 4, 20225June 5, 2022Meta
