SC is the International Conference for High Performance Computing, Networking, Storage and Analysis

# SCHEDULE: NOV 12-18, 2011

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.

You can also create your personal schedule on the SC11 app (Boopsie) on your smartphone. Simply select a session you want to attend and "add" it to your plan. Continue in this manner until you have created your own personal schedule. All your events will appear under "My Event Planner" on your smartphone.

Tiled QR factorization algorithms

SESSION: Dense Linear Algebra

EVENT TYPE: Paper

TIME: 11:00AM - 11:30AM

AUTHOR(S):Henricus M. Bouwmeester, Mathias Jacquelin, Julien Langou, Yves Robert

ROOM:TCC 305

ABSTRACT:
This work revisits existing algorithms for the QR factorization of rectangular matrices composed of \$p times q\$ tiles, where \$p geq q\$. Within this framework, we study the critical paths and performance of algorithms such as SK, MC, Greedy, and those found within PLASMA. Although neither MC nor Greedy is optimal, both are shown to be asymptotically optimal for all matrices of size \$p = q^2 f(q)\$, where \$f\$ is any function such that \$lim_{+infty} f= 0\$. This result applies to all matrices where \$p\$ and \$q\$ are proportional, \$ p = lambda q\$, with \$lambda geq 1\$, thereby encompassing many important situations in practice (least squares). We provide an extensive set of experiments that show the superiority of the new algorithms for tall matrices.

Chair/Author Details:

Henricus M. Bouwmeester - University of Colorado Denver

Mathias Jacquelin - ENS Lyon

Julien Langou - University of Colorado Denver

Yves Robert - ENS Lyon

The full paper can be found in the ACM Digital Library