ACADEMIC AND PROFESSIONAL BACKGROUND

 

Academic background

Periods Degree Location Remarks
1990-1991 Baccalauréat C Dla  
1992-1993 DEUG in Mathematics and Computer Sciences Yde  
1993-1994 Bachelor in CS Yde  
1994-1996 Master in CS Yde Introduction to parallel computing
1996-1997 DEA in CS Yde/IRISA First contact with IRISA (Rennes)
1997-2001 PhD thesis ( Contribution to parallel computing ) Yde/IRISA See ALADIN and COSI projects

 

Professionnal items

Periods Title Location
1998 - 2001 Junior Lecturer in Computer Science University of Yde I
2001 - 2003 Senior Reseacher (Operation Research and high performance scientific computing / Logilab) University of Geneva
2003 - 2004 Senior Reseacher (OR and Theoretical Computer Science / Logilab and the Informatics Center (CUI)) University of Geneva
2004 - 2005 Senior Reseacher (Combinatorial and high performance computing / The Informatics Center (CUI ) University of Geneva
2006 - 2007 Reseach Fellow (Mathematical modelling and Scientific computing for synchrotron crystallography) EMBL Grenoble
2007 - 2009 Reseach Fellow (Computation graph parallelization and program optimization) University of Paris-Sud (Orsay)
2009 - 2012 Reseach Fellow (High Performance Computing for LQCD) LAL / IN2P3 / CNRS (Orsay)
2011 - Reseacher (High Performance Computing and Automatic Code Transformations) Mines ParisTech - CRI (Fontainebleau)

 

Supervising Activities

Periods Topic Candidate Location
2001 Analyse et implementation des algorithmes pour le produit tensoriel Benedicte Kenmei (UY I) University of Yde I
2002 Medical Database System Lehner Godinho Bianca (UNIGE) University of Geneva
2003 Localisation des les reseaux de senseurs Benjamin Leveque (ENS Lyon) University of Geneva
2003 Gestion des etats de la memoire a l'aide de SimpleScalar David Schenk (APM Technology) University of Geneva
2011 High Level Optimization of the Dirac Operator Tsemo Djoua (Master II research) University Paris-Sud

 

Trips (for scientific and technical purposes)

When Where Why
1997 CANADA (Montreal and New-Brunswick) Workshop
1997 FRANCE (Rennes and Grenoble) Visiting
1998 SENEGAL (Dakar and Goree) Colloqium
1999 FRANCE (Rennes)  BELGIUM (Bruxelles) GERMANY (Hannover) Visiting
1999 MORROCO (Oujda) Symposium
2000 FRANCE (Rennes, Besancon, Strasbourg) Visiting
2000 SWITZERLAND (Geneva and Neuchatel) Visiting and Workshop
2000 MADAGASCAR (Tananarive) Colloqium
2001 GREECE (Athens and Thessaloniki) Workshop
2002

SWITZERLAND (Lausanne and Zinal)

Workshop
2002 ROMANIA (Iasi) Symposium
2002 SPAIN (Barcelone) Visiting
2003 SWITZERLAND ( Grimmentz and Lausanne ) Workshop
2003 ITALIA (Milano) Visiting
2003 GREECE ( Santorini ) Workshop
2003 DANMARK ( Copenhagen ) Symposium
2003 HUNGARY (Budapest) Symposium
2003 USA (Washington / New-York) Visiting
2003 GREECE ( Athens ) Workshop
2004 ITALY ( Verona ) Workshop
2004 ARGENTINA ( Buenos Aires ) Visiting
2004 BRASIL ( Rio de Janeiro ) Workshop
2004 MORROCO ( Casablanca ) Visiting
2004 AUSTRIA (Viena) Visiting
2004 UK ( London ) Visiting
2004 IRELAND ( Dublin ) Workshop
2005 UK ( Bristol ) Invited speaker
2005 UK (Cambridge) Invited speaker
2005 PORTUGAL (Lisbon) Invited speaker
2005 UK (Liverpool) Meeting
2006 GERMANY (Hamburg) Meeting
2007 UK (Didcot) Meeting
2007 MORROCO (Agadir) Symposium
2007 GERMANY (Heidelberg) Meeting
2010 JAPAN (Tsukuba/Tokyo) Conference
2011 FINLAND (Helsinki) Symposium/Meeting
2011 MEXICO (Mexico) International Meeting
2011 CUBA (La Habanna) Visiting

 

Selected items

  • During my third year at the university, I introduce myself to algorithmic, combinatoric and complexity challenges. My principal dream was (and remains!) to bring answers to some crucial questions yet unsolved, like those related to the theory of NP-Completeness and the design of time optimal parallel algorithms
  • In my master report, I have developped a simple work optimal algorithm for sorting items in linear time. The mains idear was to allocate each stage of the classical heapsort to one processor and perform pipeline operations. The main advantage that makes this algorithm good for pratical issue (ATM network) was the addressing rule and the possibility to performs several operations in the same cycle. I continued this work in my first PhD year and we were about to validate it when another team discovered nearly the same algorithm and published it.

  • Another interesting thing I have done during my master was to built a software (named SYSTOLICA) for the design and simulation of systolic algorithms.

  • My first contact with IRISA was based in the previous sorting algorithm together with a challenge to built an efficient parallel algorithm for the Kronecker product and for the Algebraic Path Problem.

  • I received the IEEE price of the best communication in the conference renpar11 (see here). Note that it was my first conference participation

  • The two years following my phd, I introduced myself to large-scale convex optimization and its relation with combinatorial optimization. Very exciting topic and efficient approach with serious challenges.

  • At EMBL, I was involved in computing research activities in synchrotron crystallography. It has been proven that specific radiation damage can help in solving macromolecular crystal structures. However, global damage can also occur at the same time, thereby producing a joint effect which can be hindering depending on its magnitude and the distribution of the B-values. In order to keep handling the benefit of the specific damage, we need to deconvolute between these two effects and thereby provide an efficient intensities approximation of the susceptible atoms subset. Moreover, because data collection is subject to several perturbating factors (conditions and aleas of experiments), refinement techniques need to be developped in order to either correct the data, rescale in order to make them internally consistent, or estimate critical parameters. A conjunction of such factors may lead to serious mathematical and numerical challenges

  • I am currently involved in high performance computing research activities (multicore, accelerator-based, and standard parallel (super)computers).