Print

Scheduling Methods and Algorithms in Distributed Systems

Course Instructor: Florin Pop

Syllabus:

The objectives of this course are:

  • Classification of scheduling problems;
  • Specific attributes and models of scheduling algorithms;
  • The complexity of scheduling algorithms;
  • Scheduling and resource management;
  • Advance reservation and co-allocation of resources;
  • Scheduling policies;
  • Algorithms and classical methods of scheduling: scheduling on a single processor;
  • Scheduling for parallel systems; Scheduling in distributed systems (Grid, P2P);
  • Scheduling with dependencies and workflows;
  • Methods of optimization and performance analysis;
  • Fault tolerance and rescheduling.

Applications have as main objectives analysis, implementation and testing of presented algorithms.

The project aims to create a context for the implementation of scheduling policies. Optimization of scheduling by implementing optimization techniques will be another focus of practical applications (projects). It will also study the applications of scheduling algorithms: courses and exams planning, land vehicles planning, aircraft schedule.