BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:1.0
BEGIN:VEVENT
DTSTART:20151118T201500Z
DTEND:20151118T210000Z
LOCATION:Ballroom D
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: In this talk I address one of the main challenges in high performance computing which is the increased cost of communication with respect to computation, where communication refers to data transferred either between processors or between different levels of memory hierarchy, including possibly NVMs. I will overview novel communication avoiding numerical methods and algorithms that reduce the communication to a minimum for operations that are at the heart of many calculations, in particular numerical linear algebra algorithms. Those algorithms range from iterative methods as used in numerical simulations to low rank matrix approximations as used in data analytics. I will also discuss the algorithm/architecture matching of those algorithms and their integration in several applications.
SUMMARY:Fast and Robust Communication Avoiding Algorithms: Current Status and Future Prospects
PRIORITY:3
END:VEVENT
END:VCALENDAR