Follow
Bertrand SIMON
Bertrand SIMON
Researcher, IN2P3 Computing Center, CNRS
Verified email at cnrs.fr - Homepage
Title
Cited by
Cited by
Year
Online metric algorithms with untrusted predictions
A Antoniadis, C Coester, M Elias, A Polak, B Simon
International Conference on Machine Learning, 345-355, 2020
722020
Parallel scheduling of dags under memory constraints
L Marchal, H Nagy, B Simon, F Vivien
2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2018
212018
Scheduling on two types of resources: a survey
O Beaumont, LC Canon, L Eyraud-Dubois, G Lucarelli, L Marchal, ...
ACM Computing Surveys (CSUR) 53 (3), 1-36, 2020
192020
Anti-persistence on persistent storage: History-independent sparse tables and dictionaries
MA Bender, JW Berry, R Johnson, TM Kroeger, S McCauley, CA Phillips, ...
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2016
142016
Limiting the memory footprint when dynamically scheduling DAGs on shared-memory platforms
L Marchal, B Simon, F Vivien
Journal of Parallel and Distributed Computing 128, 30-42, 2019
122019
Online scheduling of task graphs on heterogeneous platforms
LC Canon, L Marchal, B Simon, F Vivien
IEEE Transactions on Parallel and Distributed Systems 31 (3), 721-732, 2019
112019
Double coverage with machine-learned advice
A Lindermayr, N Megow, B Simon
arXiv preprint arXiv:2103.01640, 2021
92021
Malleable task-graph scheduling with a practical speed-up model
L Marchal, B Simon, O Sinnen, F Vivien
IEEE Transactions on Parallel and Distributed Systems 29 (6), 1357-1370, 2018
92018
Online scheduling of task graphs on hybrid platforms
LC Canon, L Marchal, B Simon, F Vivien
European Conference on Parallel Processing, 192-204, 2018
72018
Scheduling trees of malleable tasks for sparse linear algebra
A Guermouche, L Marchal, B Simon, F Vivien
European Conference on Parallel Processing, 479-490, 2015
62015
Learning-augmented dynamic power management with multiple states via new ski rental bounds
A Antoniadis, C Coester, M Elias, A Polak, B Simon
Advances in Neural Information Processing Systems 34, 16714-16726, 2021
52021
Fully dynamic algorithms for knapsack problems with polylogarithmic update time
F Eberle, N Megow, L Nölke, B Simon, A Wiese
arXiv preprint arXiv:2007.08415, 2020
42020
Deadlock avoidance and detection in railway simulation systems
B Simon, B Jaumard, TH Le
Transportation Research Record 2448 (1), 45-52, 2014
42014
Scheduling task graphs on modern computing platforms
B Simon
Université de Lyon, 2018
32018
Discovering and certifying lower bounds for the online bin stretching problem
M Böhm, B Simon
Theoretical Computer Science 938, 1-15, 2022
22022
Speed-robust scheduling: sand, bricks, and rocks
F Eberle, R Hoeksma, N Megow, L Nölke, K Schewior, B Simon
Mathematical Programming, 1-40, 2022
22022
Minimizing i/os in out-of-core task tree scheduling
L Marchal, S McCauley, B Simon, F Vivien
International Journal of Foundations of Computer Science, 1-30, 2022
12022
On Hop-Constrained Steiner Trees in Tree-Like Metrics
M Böhm, R Hoeksma, N Megow, L Nölke, B Simon
SIAM Journal on Discrete Mathematics 36 (2), 1249-1273, 2022
12022
Scheduling on Hybrid Platforms: Improved Approximability Window
V Fagnon, I Kacem, G Lucarelli, B Simon
Latin American Symposium on Theoretical Informatics, 38-49, 2021
12021
Computing a Minimum-Cost -hop Steiner Tree in Tree-Like Metrics
M Böhm, R Hoeksma, N Megow, L Nölke, B Simon
arXiv preprint arXiv:2003.05699, 2020
12020
The system can't perform the operation now. Try again later.
Articles 1–20