10:30 AM-12:30 PM
Room: Sidney Smith 1085
Graph partitioning has extensive applications in many areas, including scientific computing, task scheduling, VLSI design, and data mining. Significant progress has been made in developing fast and high quality graph partitioners. Focus has now shifted to efficient methods for partitioning and load balancing in dynamic and adaptive settings. Dynamic load balancing not only requires a rapid partitioner, but also an intelligent mapping of partitions to processors to reduce the data redistribution cost. This is important for problems with time-varying workloads and parallel systems with non-dedicated resources. The speakers will describe several partitioning and load-balancing algorithms, and results from recent applications to realistic problems.
See Part II, MS66.Organizers: Rupak Biswas