Bertrand SIMON
Bertrand SIMON
Postdoctoral researcher, Universität Bremen
Verified email at uni-bremen.de - Homepage
Title
Cited by
Cited by
Year
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
102018
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
82016
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
52015
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
42019
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
32018
Scheduling on two types of resources: a survey
O Beaumont, L Canon, L Eyraud-Dubois, G Lucarelli, L Marchal, ...
arXiv preprint arXiv:1909.11365, 2019
22019
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
22019
Scheduling task graphs on modern computing platforms
B Simon
22018
Online metric algorithms with untrusted predictions
A Antoniadis, C Coester, M Elias, A Polak, B Simon
arXiv preprint arXiv:2003.02144, 2020
12020
Online scheduling of sequential task graphs on hybrid platforms
LC Canon, L Marchal, B Simon, F Vivien
12018
Scheduling trees of malleable tasks for sparse linear algebra
A Guermouche, L Marchal, B Simon, F Vivien
arXiv preprint arXiv:1410.7249, 2014
12014
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time
M Böhm, F Eberle, N Megow, B Simon, L Nölke, J Schlöter, A Wiese
arXiv preprint arXiv:2007.08415, 2020
2020
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
2020
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
2020
Discovering and Certifying Lower Bounds for the Online Bin Stretching Problem
M Böhm, B Simon
arXiv preprint arXiv:2001.01125, 2020
2020
Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice
B Simon, J Falk, N Megow, J Teich
arXiv preprint arXiv:1912.09170, 2019
2019
Scheduling on Hybrid Platforms: Improved Approximability Window
V Fagnon, I Kacem, G Lucarelli, B Simon
arXiv preprint arXiv:1912.03088, 2019
2019
Minimizing i/os in out-of-core task tree scheduling
L Marchal, S McCauley, B Simon, F Vivien
2017 IEEE International Parallel and Distributed Processing Symposium …, 2017
2017
The I/O Complexity of Computing Prime Tables
MA Bender, R Chowdhury, A Conway, M Farach-Colton, P Ganapathi, ...
LATIN 2016: Theoretical Informatics, 192-206, 2016
2016
The system can't perform the operation now. Try again later.
Articles 1–20