Events in February–March 2022
MonMonday | TueTuesday | WedWednesday | ThuThursday | FriFriday | SatSaturday | SunSunday |
---|---|---|---|---|---|---|
January 31, 2022
|
FebruaryFebruary 1, 2022 |
February 2, 2022
|
February 3, 2022(2 events) Polaris-tt: Louis-Sebastien Rebuffi "Optimal Speed Profile of a DVFS Processor under Soft Deadlines" – Seminar Arnaud Legrand: "Fairness in ”Network” Resource Sharing" – |
February 4, 2022
|
February 5, 2022
|
February 6, 2022
|
February 7, 2022
|
February 8, 2022
|
February 9, 2022
|
February 10, 2022(2 events) Polaris-tt: Henry-Joseph Audéoud: "NBFS: Fast Thin Clients over Slow Networks" – Polaris-Datamove seminar Panayotis Mertikopoulos: "An ill-fated attempt to summarize some recent and not-so-recent results on learning in games" – Title: An ill-fated attempt to summarize some recent and not-so-recent results on learning in games Abstract: see title :p |
February 11, 2022
|
February 12, 2022
|
February 13, 2022
|
February 14, 2022
|
February 15, 2022
|
February 16, 2022
|
February 17, 2022
|
February 18, 2022
|
February 19, 2022
|
February 20, 2022
|
February 21, 2022
|
February 22, 2022
|
February 23, 2022
|
February 24, 2022
|
February 25, 2022
|
February 26, 2022
|
February 27, 2022
|
February 28, 2022
|
MarchMarch 1, 2022 |
March 2, 2022
|
March 3, 2022(1 event) Polaris-tt: Chen Yan: restless bandits and LP-relaxations – |
March 4, 2022
|
March 5, 2022
|
March 6, 2022
|
March 7, 2022
|
March 8, 2022
|
March 9, 2022
|
March 10, 2022(1 event) Polaris-tt: Kimang Khun: computing index policies for restless bandits – |
March 11, 2022
|
March 12, 2022
|
March 13, 2022
|
March 14, 2022
|
March 15, 2022
|
March 16, 2022
|
March 17, 2022(2 events) Polaris-tt: Till Kletti (Introducing the expohedron for fair and useful rankings) – Based on https://dl.acm.org/doi/10.1145/3488560.3498490 Seminar Bruno Raffin (Large Scale Data Assimilation) – Title: Large Scale Data Assimilation Authors: Sebastian Friedemann and Bruno Raffin Abstract: How to combine data, which may be available though different sensors, |
March 18, 2022
|
March 19, 2022
|
March 20, 2022
|
March 21, 2022
|
March 22, 2022
|
March 23, 2022
|
March 24, 2022(2 events) Polaris-tt: Victor Boone (title to be annouced) – Polaris-datamove seminar: Georges Da Costa (Multi-objective resources optimization Performance- and Energy-aware HPC and Clouds) – Titre: "Multi-objective resources optimization Performance- and Energy-aware HPC and Clouds" This talk will answer to the challenge "How to efficiently manage a datacenter ?" by providing theoretical and practical tools. Datacenters are at the center of the life of an increasing part of the world population while being mostly unknown: From online services to weather forcast. Their role, while transparent, is of the utmost importance. Their electricity consumption is then a key challenge, and will be even more in a near future. Managing efficiently leads to optimization of quality of service, but also to improving energy efficiency. This talk will show the required tools: The tools linked to measures and monitoring, from a technical point of view, but also by the definition of metrics. Then, it will explore methods to model such problems, along with direct or approximated resolution techniques. The next step will show several heuristics to quickly reach approximated solutions. Several types of validations, from experimental to improved simulated ones will serve as support for this talk. |
March 25, 2022
|
March 26, 2022
|
March 27, 2022
|
March 28, 2022
|
March 29, 2022
|
March 30, 2022
|
March 31, 2022(1 event) Seminar Bertrand Simon (An Exact Algorithm for the Linear Tape Scheduling Problem) – Title: 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. |
AprilApril 1, 2022 |
April 2, 2022
|
April 3, 2022
|