Communication-Avoiding Algorithms
The ASPIRE project (Algorithms and Specializers for Provably Optimal Implementations with Resilience and Efficiency) is motivated by the transition from a post-transistor-scaling world to one where whole-stack codesign is the key to improved efficiency. It follows on the ParLab (Parallel Computing Laboratory), an interdisciplinary research center motivated by the multicore revolution.
The Complexity of Accurate Floating Point Computation. See below for recent talks.
Proposal to update the LAPACK and ScaLAPACK linear algebra libraries, in pdf or postscript.
CITRIS is the Center for Information Technology Research in the interest of Society, a new $300M multicampus research center with the mandate of creating information technology to tackle society's most critical needs. Initial CITRIS research will focus on energy efficiency, transportation, disaster response, health care, education and environmental monitoring.
SUGAR is a simulation tool for MEMS (MicroElectroMechanical Systems), tiny sensors and actuators that form a pillar of CITRIS's approach to solving large scale societal problems. SUGAR is used by many researchers in the Berkeley Sensor and Actuator Center (BSAC).
BeBOP is Berkeley Benchmarking and OPtimization Group. We work on automatic performance optimization of numerical kernels, tuning them to run as fast as possible for particular architectures and sometimes particular inputs.
Millennium is a campus-wide project to provide hardward and sofware facilities for high performance computing. My activities are to provide algorithms, software and advice to best facilitate computational science and engineering on campus.
Templates for the Solution of Algebraic Eigenvalue Problems:
This book gives a unified overview of the theory, algorithms and
practical software for eigenvalue problems. It organizes this large
body of material to make it accessible for the first time to experts
and non-experts who need to choose the best state-of-the-art algorithms
and software for their problems.
LAPACK - Linear Algebra PACKage for high performance workstations and shared memory parallel computers. The LAPACK Manual is available on-line.
(This and much other useful numerical software is available on
Netlib.)
ScaLAPACK
- Scalable Linear Algebra PACKage for high performance distributed
memory parallel computers,
The
ScaLAPACK Manual is available on-line.
Proposal to update the LAPACK and ScaLAPACK linear algebra libraries.
SuperLU,
implementations of sparse Gaussian Elimination for
high performance parallel machines
Templates for the Solution of Linear Systems:
Building Blocks for Iterative Methods is a hyper-text book on
iterative methods for solving systems of linear equations.
A similar book project for eigenvalue problems is underway.
In Fall 08 we started a New Graduate Designated Emphasis in Computational Science and Engineering (CSE), which operates as a "graduate minor". Over 100 faculty from 20 departments and programs are participating.
Math 128a is a one semester upper division course on numerical analysis.
CS 170 is a one semester upper division course on efficient algorithms and intractable problems.
Math 221 is a one semester course in matrix computations. My text for the course, Applied Numerical Linear Algebra, was published by SIAM in August 1997.
CS 267 is a one-semester graduate class in Applications of Parallel Computers.
(Fall 2001 version of CS 267), offered by Prof. Katherine Yelick)
NSF-CBMS Short Course on
Parallel Numerical Linear Algebra, held summer 1995, and based on the
Spring 1995 version of CS 267.
Computational Science Education Project provides an on-line text book on high-performance computing. I co-authored the chapter on Parallel Numerical Linear Algebra
Math 55 is a one-semester undergraduate course in discrete mathematics, offered Spring semester 1997.