Scheduling Course
Master 2 -- ENS Lyon
Master 2 -- ENS Lyon
Lecture 1: Introduction to scheduling (17/09/2010 & 24/09/2010)
- notes for this lecture
- slides [ppt] of the talk "Complexity of scheduling" by Peter Brucker, at EPIT 2007
- a quite comprehensive classification of scheduling problems: Complexity results for scheduling problems
Lecture 2: Divisible Load Scheduling (24/09/2010 & 01/10/2010 & 08/10/2010)
- slides [pdf] of the lecture
- a research report with all the results (except return messages)
- a research report on divisible load scheduling return messages
Lecture 3: Steady-State Scheduling (08/10/2010 & 15/10/2010)
- notes [pdf] of the first lecture
- the article [pdf] for the first lecture
- notes [pdf] of the second lecture
- article [pdf] for the "scatter" operation
- general report [pdf] for DAG scheduling in steady-state
Lecture 4: Iterative Algorithm, Load Balancing and Redistribution (22/10/2010)
- slides [pdf] of the lecture
- slides [pdf] of the lecture
- a tutorial on polynomial time approximation schemes, by P. Schuurman and G. Woeginger.
- the article on Interference Aware Scheduling that will be studied in this lecture.
Exams
The exams will be organized around research articles. Each student has to choose a group of two papers in the following list, and has to present and comment them. The students must write a report (4 to 8 page long), and present it in front of the class (20 minutes of talk + 10 minuts of questions). Since this is not enough to thoroughly present both papers, the students are asked to:
- Present the common topic of the articles;
- Compare the articles in their modeling, methodology, problem statement, etc.;
- Summarize the contributions of both articles;
- Present in detail one technical point (e.g. one algorithm or one proof), which seems the most relevant, or interesting.
Some tools for bibliographic search:
Former web page of this course for year 2008/2009
Last modified: September 2010