CS267: Lecture 20

Dynamic Load Balancing

November 5, 2001

Lecturer: Kathy Yelick

Abstract

We describe some techniques for dynamic load balancing, when very little is known in advance about the number or cost of tasks being balanced.  In particular, we describe several variation on self-scheduling, used for scheduling loop iterations with unknown costs and distributed load balancing algorithms.  The lecture includes a brief overview of parallel search problems as a motivation for dynamic load balancing.

2001 Lecture Notes

PowerPoint, Postscript, PDF

Readings

  • See a Chapter in the text by Russell and Norvig for an overview of search algorithms.