May 7, 2020
keynote LIG
–
May 7, 2020
MMonday | TTuesday | WWednesday | TThursday | FFriday | SSaturday | SSunday |
---|---|---|---|---|---|---|
27April 27, 2020
|
28April 28, 2020
|
29April 29, 2020
|
30April 30, 2020
|
May1May 1, 2020 |
2May 2, 2020
|
3May 3, 2020
|
4May 4, 2020
|
5May 5, 2020
|
6May 6, 2020
|
keynote LIG – |
8May 8, 2020
|
9May 9, 2020
|
10May 10, 2020
|
11May 11, 2020
|
12May 12, 2020
|
13May 13, 2020
|
14May 14, 2020
|
15May 15, 2020
|
16May 16, 2020
|
17May 17, 2020
|
18May 18, 2020
|
19May 19, 2020
|
20May 20, 2020
|
21May 21, 2020
|
22May 22, 2020
|
23May 23, 2020
|
24May 24, 2020
|
25May 25, 2020
|
26May 26, 2020
|
27May 27, 2020
|
28May 28, 2020
|
29May 29, 2020
|
30May 30, 2020
|
31May 31, 2020
|
June1June 1, 2020 |
2June 2, 2020
|
3June 3, 2020
|
4June 4, 2020
|
5June 5, 2020
|
6June 6, 2020
|
7June 7, 2020
|
8June 8, 2020
|
9June 9, 2020
|
10June 10, 2020
|
Aurélien Garivier (Postponed due to COVID lockdown) – TBA Bâtiment IMAG (442) |
12June 12, 2020
|
13June 13, 2020
|
14June 14, 2020
|
15June 15, 2020
|
Stéphan Plassart [PhD defense]: Online Energy Optimization for real-time systems – I have the pleasure to announce you my PhD defense, entitled « Online Energy Optimization for real-time systems », which will be held by video-conference. The members of the jury are:
Abstract: The energy consumption is a crucial issue for real-time systems, that's why optimizing it online, i.e. while the processor is running, has become essential and will be the goal of this thesis. This optimization is done by adapting the processor speed during the job execution. This thesis addresses several situations with different knowledge on past, active and future job characteristics. Firstly, we consider that all job characteristics are known (the offline case), and we propose a linear time algorithm to determine the speed schedule to execute n jobs on a single processor. Secondly, using Markov decision processes, we solve the case where past and active job characteristics are entirely known, and for future jobs only the probability distribution of the jobs characteristics (arrival times, execution times and deadlines) are known. Thirdly we study a more general case: the execution is only discovered when the job is completed. In addition we also consider the case where we have no statistical knowledge on jobs, so we have to use learning methods to determine the optimal processor speeds online. Finally, we propose a feasibility analysis (the processor ability to execute all jobs before its deadline when it works always at maximal speed) of several classical online policies, and we show that our dynamic programming algorithm is also the best in terms of feasibility. |
17June 17, 2020
|
Giorgio Fabbri (GAEL) |
19June 19, 2020
|
20June 20, 2020
|
21June 21, 2020
|
22June 22, 2020
|
23June 23, 2020
|
24June 24, 2020
|
PhD defense Dong Quan Vu – |
26June 26, 2020
|
27June 27, 2020
|
28June 28, 2020
|
29June 29, 2020
|
30June 30, 2020
|
July1July 1, 2020 |
Seminar: Salah Zrigui – Title: Classification of energy profiles of HPC tasks Abstract: Salah will present how he analyzed, characterized and tried to classify energy consumption traces (time series) of HPC codes running on one of the GRICAD cluster. |
3July 3, 2020
|
4July 4, 2020
|
5July 5, 2020
|
This website uses cookies so that we can provide you with the best user experience possible. Cookie information is stored in your browser and performs functions such as recognising you when you return to our website and helping our team to understand which sections of the website you find most interesting and useful.
Strictly Necessary Cookie should be enabled at all times so that we can save your preferences for cookie settings.
If you disable this cookie, we will not be able to save your preferences. This means that every time you visit this website you will need to enable or disable cookies again.