About me

I am currently studying computer science at ENS Rennes (École Normale Supérieure de Rennes) in France for a master degree. I am particularly interesting in distributed computing, optimisation, and scheduling.

You can find my CV, a list of the classes I took and the publications and projects I have worked on.


E-mail: nathanael.cheriere@ens-rennes.fr

Curriculum Vitae

A pdf version can be found here.


Ongoing Second year of Research Master in Computer Science
ENS de Rennes - Université Rennes 1
Computer science and research.
2013-2014 First year of Research Master in Computer Science
ENS de Rennes - Université Rennes 1
Computer science, mathematics and telecommunications.
2012-2013 "License d'informatique"
ENS de Rennes - Université Rennes 1
Bachelor Degree in Computer Science
Computer science, mathematics and telecommunications.
2009-2012 "Classe Préparatoires (MPSI-MP)"
Lycée Pothier, Orléans
Intensive courses in mathematics and physics.
2009 "Baccalauréat Scientifique"
Lycée François Villon, Beaugency
High School Degree.


02-06 2015 Research Internship
Inria Rennes, Rennes, France
Design of a new scheduler for Hadoop focusing on the heterogeneity of both jobs and clusters.
Under the supervision of Shadi Ibrahim, Gabriel Antoniu, and Luc Bougé.
06-08 2014 Research Internship
University of North Carolina Charlotte, Charlotte, United States
Investigation of decentralized scheduling algorithms for heterogeneous systems with proven guarantees.
Supervised by Erik Saule.
Read the report.
Paper accepted at the Heterogeneity Computing Workshop (HCW 2015) to be held with IPDPDS 2015.
05-07 2013 Research Internship
Inria Grenoble, Grenoble, France
Creation of a new heuristic for the Internet Shopping Problem.
Supervised by Denis Trystram and Pierre-François Dutot.
Read the report.
Paper published.
08 2008 Internship
Ecom90, Horsham, United Kingdom
Setting up automatic tests in a software to check compability between versions.

Technical Skills

Programming Languages Java, C, C++, Ocaml.
Other Latex, Linux, Git.


French Mother Tongue.
English Good level. TOEIC 975/990 (2013).
Many stays in the United Kingdom.
Spanish Read.


Master 2 - 2014/2015

I followed the track "Network and Distributed System" from the Research in Computer Science Master at University Rennes 1.

First Semester

Second Semester

Master 1 - 2013/2014

I obtained my Master 1 in Research in Computer Science at University Rennes 1 .

First Semester

Second Semester

Graduate Year - 2012/2013

I graduated in Computer Science on the ENS Rennes.

First Semester

Second Semester

Previous Years - 2009/2012

I was enrolled in the French "classes préparatoires" which are intensive classes in mathematics and physics.


Internet Shopping: Towards bicriteria optimization.

One of the very important topics in discrete optimization, motivated by practical applications, is Internet shopping, which is becoming increasingly popular each year. More classical versions of the Internet shopping optimization problem (ISOP) are closely related to the facility location problem and some scheduling problems and have been intensively studied in the literature. In this paper, extensions of the problem are defined and studied. The issue is to buy all the necessary products for a minimum total possible price. This includes all prices of products as well as shipping costs. Studies in this paper include the ISOP with price sensitive discounts and a newly defined optimization problem: the ISOP including two different discounting functions, namely a shipping cost function as well as a price discounting function. First, these are formulated as mathematical programming problems. Then, some algorithms are constructed and extensively tested in a computational experiment.

You can find the article here.


Optimized Hadoop for Big Data Processing in the cloud

Master 1 Research Project

We designed hSRTF, a new Scheduler for Hadoop providing more options for administrators. hSRTF exposes the adaptation of the SRTF policy (Shortest Remaining Time First) in Hadoop, preserving data-locality and fairness, however, hSRTF prioritises jobs according to their dynamic estimated running time, not only on their input data size.