Lecture 23

Lecture 23: Partitioning and Dynamic Load Balancing
Date: Thursday, November 30, 2017

Agenda

Announcements
Term Project
- paper drafts, as complete as possible, due Monday
- presentations next week: Matt and Team K/T/A/E on Tuesday, others on Thursday
Programming Project 4: Traveling Salesperson Problem - keep making progress, due at the end of the semester
More partitioning and dynamic load balancing
- you should read and be able to understand most of the material up to Section 3 in the paper posted as part of the previous lecture and some final exam questions will be based on this material
- distrubuted data structures examples: see Section 2 of this paper, J. E. Flaherty, R. M. Loy, C. Özturan, M. S. Shephard, B. K. Szymanski, J. D. Teresco and L. H. Ziantz. Parallel structures and dynamic load balancing for adaptive finite element computation. Appl. Num. Math., Vol. 26, pp. 241-263, 1998.
- basic partitioning/load balancing algorithms
- resource-aware load balancing