'Jim demmel uc berkeley' presentation slideshows

The Future of LAPACK and ScaLAPACK www.netlib.org/lapack-dev

1.11k views • 98 slides

The Future of LAPACK and ScaLAPACK www.netlib.org/lapack-dev

The Future of LAPACK and ScaLAPACK www.netlib.org/lapack-dev. Jim Demmel UC Berkeley 28 Sept 2005. Outline. Motivation Participants Goals Better numerics (faster and more accurate algorithms) Expand contents (more functions, more parallel implementations) Automate performance tuning

769 views • 59 slides

The Future of LAPACK and ScaLAPACK www.netlib.org/lapack-dev

The Future of LAPACK and ScaLAPACK www.netlib.org/lapack-dev. Jim Demmel UC Berkeley 14 Feb 2006. Outline. Motivation Participants Goals Better numerics (faster and more accurate algorithms) Expand contents (more functions, more parallel implementations) Automate performance tuning

711 views • 59 slides

Avoiding Communication in Linear Algebra

Avoiding Communication in Linear Algebra. Jim Demmel UC Berkeley b ebop.cs.berkeley.edu. Motivation . Running time of an algorithm is sum of 3 terms: # flops * time_per_flop # words moved / bandwidth # messages * latency. communication. Motivation .

623 views • 43 slides