Arnaud Legrand
11
Documents
Présentation
### Contact:
arnaud.legrand@imag.fr
### Webpage:
[Academic Page ](http://mescal.imag.fr/membres/arnaud.legrand/)
### Resume:
Arnaud Legrand is the leader of the [POLARIS](https://team.inria.fr/polaris/) team. He is a [CNRS](http://www.cnrs.fr/) research scientist at the [LIG](http://www.liglab.fr/). His research targets the management (mostly from an algorithmic point of view, i.e., scheduling, load balancing, fairness, game theory….) and performance evaluation (in particular through simulation, visualization, statistical analysis, …) of large scale distributed computing infrastructures such as clusters, grids, desktop grids, volunteer computing platforms, clouds,… when used for scientific computing. He is one of the main developers of the [**SimGrid**](http://simgrid.gforge.inria.fr/) project, a **simulation** toolkit for building simulators of distributed applications (originally designed for scheduling algorithm evaluation purposes) developed in collaboration with [Henri Casanova](http://navet.ics.hawaii.edu/%7Ecasanova/), [Martin Quinson](http://www.loria.fr/%7Equinson/) and [Frédéric Suter](http://graal.ens-lyon.fr/%7Efsuter/).
###
### Education and Professional Experience
Nov. 2015*Habilitation à Diriger des Recherches*, University of GrenobleOct. 2004-…:Tenured Researcher for the CNRS (*Chargé de Recherche*) at Laboratoire d'Informatique de Grenoble.2004-2005:Post-Doctoral Research Associate, UCSD (USA). Collaboration with Henri Casanova, Larry Carter and Jeanne Ferrante.2003-2004:Post-Doctoral Research Associate, École Normale Supérieure de Lyon (France).2000-Dec. 2003:Ph.D. Computer Science, École Normale Supérieure de Lyon. Laboratoire de l'Informatique du Parallélisme. Thesis: *Heterogeneous parallel algorithms and scheduling : static and dynamic approaches* Advisors: Prof. Olivier Beaumont and Prof. Yves Robert.
Publications
- 11
- 5
- 2
- 2
- 2
- 1
- 11
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 3
- 1
- 1
- 1
- 1
|
|
Fair scheduling of bag-of-tasks applications using distributed Lagrangian optimizationJournal of Parallel and Distributed Computing, 2013, ⟨10.1016/j.jpdc.2013.08.011⟩
Article dans une revue
hal-00872473v1
|
Nash Equilibrium Based FairnessMathematical Methods of Operations Research, 2012, 76 (1), ⟨10.1007/s00186-012-0389-2⟩
Article dans une revue
hal-00743123v1
|
Practical Implementation Issues of Lagrangian Based Distributed Optimization Algorithms12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (Synasc), 2010, Timisoara, Romania. pp.331-334, ⟨10.1109/SYNASC.2010.80⟩
Communication dans un congrès
hal-00788878v1
|
|
Nash Equilibrium Based FairnessInternational Conference on Game Theory for Networks (GameNets) - 2009, May 2009, Istanbul, Turkey. pp.533 - 539, ⟨10.1109/GAMENETS.2009.5137442⟩
Communication dans un congrès
hal-00789437v1
|
|
Toward a Fully Decentralized Algorithm for Multiple Bag-of-tasks Application Scheduling on GridsIEEE/ACM International Conference on Grid Computing (Grid), 2008, Tsukuba, Japan, ⟨10.1109/GRID.2008.4662790⟩
Communication dans un congrès
hal-00789438v1
|
|
How to measure efficiency?Proceedings of the 1st International Workshop on Game theory for Communication networks (Game-Comm\'07), 2007, Unknown
Communication dans un congrès
hal-00789439v1
|
|
|
|
Non-Cooperative Scheduling of Multiple Bag-of-Task ApplicationsINFOCOM, May 2007, Anchorage, Alaska
Communication dans un congrès
inria-00153577v1
|
|
|
From Flow Control in Multi-path Networks to Multiple Bag-of-tasks Application Scheduling on Grids[Research Report] RR-7745, INRIA. 2011, pp.26
Rapport
inria-00627532v1
|
|
|
Toward a Fully Decentralized Algorithm for Multiple Bag-of-tasks Application Scheduling on Grids[Research Report] INRIA. 2008, pp.27
Rapport
inria-00279993v2
|
|
|
How to measure efficiency?[Research Report] RR-6216, INRIA. 2007, pp.23
Rapport
inria-00153720v2
|
|
|
Non-cooperative scheduling of multiple bag-of-task applications[Research Report] RR-5819, INRIA. 2006, pp.31
Rapport
inria-00070206v2
|