SCHEDULE: NOV 10-16, 2012
When viewing the Technical Program schedule, on the far righthand side is a column labeled "PLANNER." Use this planner to build your own schedule. Once you select an event and want to add it to your personal schedule, just click on the calendar icon of your choice (outlook calendar, ical calendar or google calendar) and that event will be stored there. As you select events in this manner, you will have your own schedule to guide you through the week.
Communication-Avoiding Algorithms for Linear Algebra and Beyond
SESSION: Algorithmic Innovations for Large-Scale Computing
EVENT TYPE: Keynote and Invited Talks
TIME: 3:30PM - 4:15PM
SESSION CHAIR: Bernd Mohr
Presenter(s):James Demmel
ROOM:Ballroom-EFGH
ABSTRACT:
Algorithms have two costs: arithmetic and communication, i.e., moving data between levels of a memory hierarchy or processors over a network. Communication costs (measured in time or energy per operation) already greatly exceed arithmetic costs, and the gap is growing over time following technological trends. Thus our goal is to design algorithms that minimize communication. We present algorithms that attain provable lower bounds on communication, and show large speedups compared to their conventional counterparts. These algorithms are for direct and iterative linear algebra, for dense and sparse matrices, as well as direct n-body simulations. Several of these algorithms exhibit perfect strong scaling, in both time and energy: run time (resp. energy) for a fixed problem size drops proportionally to p (resp. is independent of p). Finally, we describe extensions to algorithms involving arbitrary loop nests and array accesses, assuming only that array subscripts are linear functions of the loop indices.
Chair/Presenter Details:
Bernd Mohr (Chair) - Juelich Supercomputing Center
James Demmel - University of California, Berkeley
Click here to download .ics calendar file
