HPC2N
High Performance Computing Center North
Para06 - Minisymposium - MS15
Minisymposium - MS15 |
[MS14] [MS16] |
Tuesday, June 20, 2006, 10.30-12.30 - Loke
Novel Data Formats and Algorithms for Dense Linear Algebra Computations (Part 1 of 3)
Organizers and Chair persons:
Fred Gustavson, IBM T.J. Watson Research Center, New York, USA and Umeå University
Jerzy Wasniewski, Technical University of Denmark, Lyngby, Denmark
Jerzy Wasniewski, Technical University of Denmark, Lyngby, Denmark
Recently, recursion was introduced into the area of Dense Linear Algebra with the intent of producing new algorithms as well as improving its existing algorithms. Recursion, via the divide-and-conquer paradigm, introduced variable blocking to complement the standard fixed block algorithms. In particular, new data structures for dense linear algebra became an active research area. This minisymposium will focus on both new data structures and/or new or existing algorithms for high performing dense linear algebra algorithms.
- 10.30-10.50 Cache Oblivious Matrix Operations Using Peano Curves [#248]
Michael Bader - 10.50-11.10 Hierarchical Array Layouts Require Domain-Specific Compiler Support [#193]
Olav Beckmann, Paul Kelly - 11.10-11.30 Matrix Computations: From Cell Caching to Cell Architectures [#247]
Anne C. Elster - 11.30-11.50 Three Algorithms for Cholesky Factorization on Distributed Memory using Packed Storage [#216]
Fred Gustavson, Lars Karlsson, Bo Kågström - 11.50-12.10 Minimal Data Copy For Dense Linear Algebra Factorization [#217]
Fred Gustavson - 12.10-12.30 In-Place Transposition of Rectangular Matrices [#218]
Fred Gustavson, Tadeusz Swirszcz
Updated: 2024-04-17, 14:47