SC12 Home > SC12 Schedule > SC12 Presentation - Beating MKL and ScaLAPACK at Rectangular Matrix Multiplication Using the BFS/DFS Approach

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.

Beating MKL and ScaLAPACK at Rectangular Matrix Multiplication Using the BFS/DFS Approach

SESSION: Research Poster Reception

EVENT TYPE: Posters and Electronic Posters

TIME: 5:15PM - 7:00PM

SESSION CHAIR: Torsten Hoefler

AUTHOR(S):James Demmel, David Eliahu, Armando Fox, Shoaib Kamil, Benjamin Lipshitz, Oded Schwartz, Omer Spillinger

ROOM:East Entrance

ABSTRACT:
We present CARMA, the first implementation of a communication-avoiding parallel rectangular matrix multiplication algorithm, attaining significant speedups over both MKL and ScaLAPACK. Combining the recursive BFS/DFS approach of Ballard, Demmel, Holtz, Lipshitz and Schwartz (SPAA '12) with the dimension splitting technique of Frigo, Leiserson, Prokop and Ramachandron (FOCS '99), CARMA is communication-optimal, cache- and network-oblivious, and simple to implement (60 lines of code for the shared-memory version). Since CARMA minimizes communication across the network, between NUMA domains, and between levels of cache, it performs well on both shared- and distribute-memory machines.

Chair/Author Details:

Torsten Hoefler (Chair) - ETH Zurich

James Demmel - University of California, Berkeley

David Eliahu - University of California, Berkeley

Armando Fox - University of California, Berkeley

Shoaib Kamil - University of California, Berkeley

Benjamin Lipshitz - University of California, Berkeley

Oded Schwartz - University of California, Berkeley

Omer Spillinger - University of California, Berkeley

Add to iCal  Click here to download .ics calendar file

Add to Outlook  Click here to download .vcs calendar file

Add to Google Calendarss  Click here to add event to your Google Calendar

Beating MKL and ScaLAPACK at Rectangular Matrix Multiplication Using the BFS/DFS Approach

SESSION: Research Poster Reception

EVENT TYPE:

TIME: 5:15PM - 7:00PM

SESSION CHAIR: Torsten Hoefler

AUTHOR(S):James Demmel, David Eliahu, Armando Fox, Shoaib Kamil, Benjamin Lipshitz, Oded Schwartz, Omer Spillinger

ROOM:East Entrance

ABSTRACT:
We present CARMA, the first implementation of a communication-avoiding parallel rectangular matrix multiplication algorithm, attaining significant speedups over both MKL and ScaLAPACK. Combining the recursive BFS/DFS approach of Ballard, Demmel, Holtz, Lipshitz and Schwartz (SPAA '12) with the dimension splitting technique of Frigo, Leiserson, Prokop and Ramachandron (FOCS '99), CARMA is communication-optimal, cache- and network-oblivious, and simple to implement (60 lines of code for the shared-memory version). Since CARMA minimizes communication across the network, between NUMA domains, and between levels of cache, it performs well on both shared- and distribute-memory machines.

Chair/Author Details:

Torsten Hoefler (Chair) - ETH Zurich

James Demmel - University of California, Berkeley

David Eliahu - University of California, Berkeley

Armando Fox - University of California, Berkeley

Shoaib Kamil - University of California, Berkeley

Benjamin Lipshitz - University of California, Berkeley

Oded Schwartz - University of California, Berkeley

Omer Spillinger - University of California, Berkeley

Add to iCal  Click here to download .ics calendar file

Add to Outlook  Click here to download .vcs calendar file

Add to Google Calendarss  Click here to add event to your Google Calendar