3. Scheduling and Load-Balancing


Scheduling and load balancing techniques are crucial for implementing efficient parallel and distributed applications and for making best use of parallel and distributed systems. These techniques can be provided either at the application level or at the system level, and both approaches are of interest for this topic. At the application level, the mapping of parallel computations onto parallel computer systems and the development of dynamic load balancing algorithms that are able to exploit the particular characteristics and the actual utilization of the underlying parallel computer system are of particular relevance. At the system level, areas of interest include checkpointing and migration, workload modeling, and resource management strategies. Theoretical results that can be used as solid foundations for designing efficient and robust scheduling, load-balancing, and/or resource management algorithms are particularly welcome together with novel such algorithms for modern parallel and distributed systems such as clusters, grids, and global computing platforms.


  • Scheduling algorithms for homogeneous or heterogeneous platforms
  • Theoretical foundations of scheduling algorithms
  • Robustness of scheduling algorithms
  • Multi-criteria scheduling
  • Decentralised or hierarchical scheduling
  • Adaptive load balancing algorithms
  • Evaluation and analysis of load balancing and scheduling techniques
  • Implementations of scheduling and load-balancing algorithms
  • Tools and environments for load balancing and scheduling
  • Workload characterization and modeling
  • Workflow and job scheduling

Topic committee

Global chair
Emmanuel Jeannot INRIA France
Vice chair
Helen Karatza University Thessaloniki Greece
Daniel Grosu Wayne State University USA
Local chair
Ramin Yahyapour Technical University Dortmund Germany



August 25, 2009
0 days to go

Registration Logo

Registration is closed

Supported by

TU Delft Logo

PDS Logo

ACM Logo

Xtreem Logo