BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:1.0
BEGIN:VEVENT
DTSTART:20141120T220000Z
DTEND:20141120T221500Z
LOCATION:386-87
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: Optimizing high-performance physical simulations to run on ever-growing=0Asupercomputing systems is challenging.  The dynamic behavior of large modern parallel simulation codes can lead to imbalances in computational load among processors. Load imbalance is particularly expensive at scale, because hundreds of thousands of idle processors may wait on a single overloaded processor.  Future machines will support even more parallelism and efficiently redistributing and balancing load will be critical for good performance.=0A=0AIn this thesis, I address how to evaluate load imbalance and=0Amake its correction affordable.  I developed a model for comparison of load balance algorithms in the context of a specific application imbalance scenario,=0Aenabling the selection of a balancing algorithm that will minimize overall runtime. I provide an accurate and fast method to balance the load in simulations with highly non-uniform density. I devised a framework for decoupling the load balancer from the application, enabling asynchronous load balancing.
SUMMARY:Load Balancing Scientific Applications
PRIORITY:3
END:VEVENT
END:VCALENDAR