Lecture 3/11/2002 1:17:45 - 1:18:45 Adding representations of functions Lecture 3/13/2002 0:33:15 - 0:41:00 Addition algorithms using binomial coefficients Lecture 4/01/2002 0:22:30 - 0:34:00 Algorithms (Ax=b) Lecture 4/01/2002 1:16:46 - 1:25:00 The Landscape of Sparse Ax=b Solvers Lecture 4/08/2002 0:09:45 - 0:14:45 The Landscape of Sparse Ax=b Solvers Lecture 5/01/2002 0:28:45 - 0:30:45 Amdahl's law Lecture 5/08/2002 0:25:30 - 0:37:30 An "Active Surface" Lecture 2/06/2002 0:59:00 - 1:04:15 Applications Lecture 5/01/2002 0:53:00 - 0:56:26 Applications Lecture 2/06/2002 1:07:00 - 1:09:00 Applications: embarrassingly parallel applications Lecture 2/06/2002 1:04:15 - 1:07:00 Applications: goals of parallel computing Lecture 2/20/2002 0:36:00 - 0:40:00 Asic White at Lawrence Livermore Lecture 2/19/2002 0:26:00 - 0:42:00 Associative Operations Lecture 4/17/2002 0:40:00 - 0:42:45 Award ceremony Lecture 2/25/2002 0:39:00 - 0:43:00 BLAS Lecture 2/11/2002 1:09:30 - 1:22:00 Bad parallel algorithms Lecture 3/06/2002 1:00:00 - 1:08:00 Barnes-Hut Lecture 4/10/2002 1:21:00 - 1:25:00 Basic Msg Passing Lecture 4/10/2002 0:16:30 - 0:19:30 Beamforming and Detection Lecture 2/06/2002 1:15:00 - 1:23:00 Beowulf Lecture 3/20/2002 0:02:00 - 0:03:25 Building Lecture 3/20/2002 1:05:20 - 1:08:00 Exercise: Design a $30,000 Beowulf Lecture 3/20/2002 0:37:45 - 0:48:08 Experience with hardware Lecture 3/20/2002 0:57:15 - 1:00:50 Experience with software Lecture 3/20/2002 0:17:30 - 0:37:45 Hardware options Lecture 3/20/2002 0:03:25 - 0:07:00 History Lecture 3/20/2002 0:07:00 - 0:10:00 List of clusters on the web Lecture 3/20/2002 1:00:50 - 1:05:20 Recipe (what really happened) Lecture 3/20/2002 0:48:08 - 0:57:15 Software options Lecture 3/20/2002 0:10:00 - 0:17:30 definition, motivation Lecture 2/27/2002 0:34:00 - 0:35:00 Block Column Major Order Lecture 2/27/2002 0:39:00 - 0:42:00 Blocked Mat-Mult is Optimal Lecture 2/27/2002 0:29:00 - 0:30:00 Blocking Lecture 2/20/2002 0:31:00 - 0:36:00 Bus as an interconnect network Lecture 4/10/2002 1:06:00 - 1:13:30 C++ Expression Templates and PETE Lecture 2/20/2002 0:55:00 - 1:09:00 CM-2 Lecture 2/20/2002 0:48:00 - 0:55:00 Cache Coherence Lecture 3/18/2002 0:04:30 - 0:16:00 How it's enforced Lecture 3/18/2002 0:16:00 - 0:27:30 Write invalidate vs write update protocols Lecture 3/18/2002 0:27:30 - 0:32:40 Write invalidate with write-back cache Lecture 2/06/2002 0:06:20 - 0:07:43 Class machine: beowulf.lcs.mit.edu Lecture 2/13/2002 0:12:00 - 0:12:40 Connecting Lecture 5/01/2002 0:00:30 - 0:02:11 Cleve Moler introduction Lecture 5/08/2002 0:47:45 - 0:57:00 Collaborative Sensoring: Acoustic Tracking Lecture 4/03/2002 0:40:50 - 0:44:40 Column Elimination Tree Lecture 4/03/2002 0:47:00 - 0:48:40 Column Preordering for Sparsity Lecture 5/01/2002 0:08:00 - 0:17:00 Commercial Matlab Lecture 4/01/2002 1:12:15 - 1:16:46 Complexity of Direct Methods Lecture 4/08/2002 1:22:00 - 1:25:00 Complexity of direct methods Lecture 4/08/2002 0:14:45 - 0:22:00 Conjugate gradient iteration Lecture 4/08/2002 0:22:00 - 0:31:15 Krylov subspaces Lecture 4/08/2002 0:31:15 - 0:37:15 Convergence Lecture 4/08/2002 0:47:15 - 0:59:30 Parallel implementation Lecture 5/01/2002 0:40:45 - 0:47:00 Cornell's Multi-Matlab Lecture 5/01/2002 0:47:45 - 0:49:00 Multi-Matlab: Introduction Lecture 5/01/2002 0:49:00 - 0:53:00 What is (and isn't) Multi-Matlab? Why now? Lecture 2/06/2002 0:00:00 - 0:06:20 Course Administration Lecture 2/06/2002 0:11:10 - 0:12:15 Course Administration: class topics and calendar Lecture 2/06/2002 0:07:43 - 0:11:10 Course Administration: schedule of projects Lecture 2/20/2002 0:40:00 - 0:48:00 Cross Bar Lecture 4/17/2002 0:00:00 - 0:01:50 Domain Decomposition (DD) Lecture 4/17/2002 0:42:45 - 0:46:00 Discretization Lecture 4/17/2002 0:19:30 - 0:21:45 History: why did Schwarz do this in 1870? Lecture 4/17/2002 0:52:30 - 1:00:40 Jacobi and Gauss-Seidel iterations Lecture 4/17/2002 1:06:00 - 1:11:07 Linear algebra formulation of Jacobi and Gauss-Seidel Lecture 4/17/2002 0:21:45 - 0:30:00 Nonoverlapping DD, example in FEMLAB Lecture 4/17/2002 0:30:00 - 0:39:00 Normal derivatives on the boundary Lecture 4/17/2002 0:01:50 - 0:10:00 Overlapping case of DD, example in FEMLAB Lecture 4/17/2002 1:00:40 - 1:06:00 Overlappping DD as block Jacobi or block Gauss-Seidel Lecture 4/17/2002 1:20:00 - 1:23:45 Solving the Schur complement system iteratively Lecture 4/17/2002 0:10:00 - 0:19:30 Summary of overlapping DD Lecture 4/17/2002 0:39:00 - 0:40:00 Summary of overlapping and nonoverlapping DD Lecture 4/17/2002 1:11:07 - 1:20:00 The nonoverlapping case: computational issues Lecture 4/17/2002 0:46:00 - 0:52:30 The overlapping case: computational issues Lecture 4/01/2002 0:21:00 - 0:22:30 Data Structures Lecture 3/06/2002 0:57:00 - 1:00:00 Qct-tree Lecture 3/06/2002 0:53:00 - 0:57:00 Quad-tree Lecture 2/27/2002 0:16:00 - 0:20:00 Dense Linear Algebra Lecture 4/03/2002 0:10:00 - 0:15:00 Direct Methods Lecture 5/01/2002 1:07:10 - 1:30:30 Discussion of implementation considerations Lecture 2/25/2002 1:01:00 - 1:04:00 Distributed and Parallel Systems Lecture 3/18/2002 0:32:40 - 0:39:20 Distributed shared memory Lecture 4/24/2002 0:37:30 - 0:44:30 The Dual Problem Lecture 4/24/2002 0:44:30 - 0:50:00 Solving the Dual Problem Lecture 4/01/2002 0:41:30 - 0:46:00 Elimination Tree Lecture 3/11/2002 0:21:00 - 0:25:20 Exclusion sum as matrix decomposition Lecture 3/11/2002 0:12:30 - 0:21:00 Exclusion sum as matrix/vector multiplication Lecture 3/13/2002 0:23:50 - 0:25:00 Exclusion sum on Taylor series Lecture 3/04/2002 0:57:00 - 1:02:00 FEMLAB overview Lecture 3/04/2002 1:02:00 - 1:17:00 Demo Lecture 3/04/2002 1:17:00 - 1:25:00 How it works Lecture 4/29/2002 0:00:00 - 0:01:15 Fast Fourier Transform (FFT) Lecture 4/29/2002 0:01:15 - 0:05:15 Definition of discrete Fourier transform Lecture 4/29/2002 0:05:15 - 0:09:25 Pictures of FFTs Lecture 4/29/2002 0:09:25 - 0:23:52 Example of phone tones Lecture 4/29/2002 0:23:52 - 0:26:57 The FFT algorithm Lecture 4/29/2002 0:26:57 - 0:29:30 Unshuffle Lecture 4/29/2002 0:29:30 - 0:31:20 The matrix recurrence for Fn Lecture 4/29/2002 0:31:20 - 0:37:00 Recursive form of the algorithm Lecture 4/29/2002 0:37:00 - 0:44:45 Unwrapping the recurrence: bit reversal Lecture 4/29/2002 0:44:45 - 0:47:45 Books on the FFT Lecture 4/29/2002 0:47:45 - 0:53:00 Performance issues: the butterfly Lecture 4/29/2002 0:53:00 - 0:57:20 Parallel issues: communication Lecture 4/29/2002 0:57:20 - 1:05:30 notation: putting bars on digits, hypercube FFT Lecture 4/29/2002 1:05:30 - 1:11:00 Back to parallel communication issues Lecture 4/29/2002 1:11:00 - 1:21:07 Detailed look at a parallel FFT of size 32 on 4 processors Lecture 5/06/2002 0:02:10 - 0:03:10 "Fastest Fourier Transform in the West" (FFTW) Introduction Lecture 4/29/2002 1:21:07 - 1:22:30 preview Lecture 5/06/2002 0:03:10 - 0:06:00 Steve Johnson Lecture 5/06/2002 0:06:00 - 0:13:12 Performance of FFTW Lecture 5/06/2002 0:13:12 - 0:15:38 Why FFTW is fast Lecture 5/06/2002 0:15:38 - 0:19:20 User's view of FFTW Lecture 5/06/2002 0:19:20 - 0:19:36 Outline of rest of talk Lecture 5/06/2002 0:19:36 - 0:23:00 The executor Lecture 5/06/2002 0:23:00 - 0:34:50 Cooley-Tukey FFT algorithm Lecture 5/06/2002 0:34:50 - 0:37:25 What a plan looks like Lecture 5/06/2002 0:37:25 - 0:39:58 Explicit recursion and out-of-cache FFTs Lecture 5/06/2002 0:39:58 - 0:43:20 Cache-oblivious FFT algorithms Lecture 5/06/2002 0:43:20 - 0:47:15 Vector recursion Lecture 5/06/2002 0:47:15 - 0:49:00 The planner Lecture 5/06/2002 0:49:00 - 0:56:30 How the planner works Lecture 5/06/2002 0:56:30 - 0:59:45 Why use adaptive programs? Lecture 5/06/2002 0:59:45 - 1:01:05 Self-optimization is easy Lecture 5/06/2002 1:01:05 - 1:02:38 The generator, genfft Lecture 5/06/2002 1:02:38 - 1:04:45 genfft finds good/new algorithms Lecture 5/06/2002 1:04:45 - 1:06:30 genfft's compilation strategy Lecture 5/06/2002 1:06:30 - 1:08:00 DAG creation Lecture 5/06/2002 1:08:00 - 1:12:40 OCAML Cooley-Tukey FFT Lecture 5/06/2002 1:12:40 - 1:16:25 Rader's algorithm for prime-size DFT Lecture 5/06/2002 1:16:25 - 1:20:20 The simplifier Lecture 5/06/2002 1:20:20 - 1:24:40 Conclusions and ongoing work Lecture 4/24/2002 0:50:00 - 0:54:45 FMSvm Demo Lecture 4/01/2002 1:01:00 - 1:06:10 Fill Reducing Matrix Permutations Lecture 4/10/2002 0:13:45 - 0:16:30 Filtering Lecture 5/08/2002 1:14:45 - 1:30:00 Final Thoughts Lecture 2/13/2002 0:01:20 - 0:12:00 First homework assignment Lecture 3/11/2002 1:10:00 - 1:17:45 Fitting a polynomial to the example Lecture 2/19/2002 0:54:00 - 1:01:00 Fortran Lecture 5/01/2002 0:04:30 - 0:08:00 Fortran Matlab Lecture 2/25/2002 0:53:00 - 1:01:00 Gaussian Elimination Lecture 4/03/2002 0:15:00 - 0:17:00 GEPP: Gaussian elimination w/ partial pivoting Lecture 2/25/2002 1:08:00 - 1:26:00 Reorganization Lecture 4/03/2002 0:21:30 - 0:26:00 Symbolic Gaussian Elimination Lecture 4/01/2002 0:35:20 - 0:41:30 Graphs and Sparse Matrices: Cholesky Factorization Lecture 5/08/2002 0:37:30 - 0:43:15 Hierarchical Distributed Control Lecture 4/10/2002 1:19:30 - 1:21:00 High Productivity Lauguage Experiments Lecture 5/01/2002 0:02:11 - 0:04:30 History of Matlab Lecture 5/01/2002 0:17:00 - 0:28:45 History of parallel computing Lecture 2/25/2002 0:27:00 - 0:29:00 History, Top 500 ... Lecture 2/20/2002 1:09:00 - 1:20:00 Hypercube Lecture 4/08/2002 1:07:00 - 1:18:30 Incomplete Cholesky factorization Lecture 3/11/2002 0:32:00 - 0:45:30 Interpolating polynomials Lecture 4/03/2002 0:58:00 - 1:05:30 Iterative refinement to improve solution Lecture 2/20/2002 0:08:00 - 0:14:00 Latency/Bandwidth Lecture 2/20/2002 0:14:00 - 0:23:00 Latency: the details Lecture 2/11/2002 0:05:20 - 0:08:40 Lattice QCD Lecture 2/11/2002 0:20:15 - 0:28:30 clusters for LQCD computation Lecture 2/11/2002 0:28:30 - 0:29:30 conclusion Lecture 2/11/2002 0:12:10 - 0:20:15 lattice QCD computations Lecture 2/11/2002 0:08:40 - 0:12:10 what is QCD and why is it important? Lecture 4/03/2002 0:27:30 - 0:33:00 Left-looking Column LU Factorization Lecture 2/25/2002 0:14:00 - 0:27:00 Linear Algebra Libraries Lecture 2/27/2002 0:07:00 - 0:08:00 Linear Algebra Lecture 2/27/2002 0:08:00 - 0:11:00 Fundamental Triangle Lecture 2/27/2002 0:11:00 - 0:12:00 Algorithm & Architecture Lecture 2/27/2002 0:12:00 - 0:16:00 Architecture ... Lecture 2/27/2002 0:16:00 - 0:20:00 Dense Linear Algebra Lecture 2/27/2002 0:20:00 - 0:22:00 Basic Algorithm Change Lecture 2/27/2002 0:22:00 - 0:29:00 FMA Instruction Lecture 2/27/2002 0:30:00 - 0:34:00 Recursion Lecture 2/27/2002 0:35:00 - 0:39:00 Square Block ... Lecture 2/27/2002 0:42:00 - 0:44:00 Matrix Multiplication is Pervasive Lecture 2/27/2002 0:44:00 - 0:48:00 Recursion Lecture 2/27/2002 0:48:00 - 0:49:00 Standard Full Format Lecture 2/27/2002 0:49:00 - 0:51:00 Block Hybrid Full Format Lecture 2/27/2002 0:51:00 - 0:55:00 Blocked Based Algorithms Via LAPACK Lecture 2/27/2002 0:55:00 - 0:57:00 Concise Algorithms Emerge Lecture 2/27/2002 0:57:00 - 1:01:00 Tree Diagram of Cholesky Algorithm Lecture 2/27/2002 1:01:00 - 1:04:00 Challenge of Machine Independent Design of Dense Linear Algebra Codes via the BLAS Lecture 2/27/2002 1:04:00 - 1:06:00 Can we exploit this general relationship? Lecture 2/27/2002 1:07:00 - 1:11:00 Dimension Theory Lecture 2/27/2002 1:11:00 - 1:12:00 Changes Lecture 2/27/2002 1:12:00 - 1:13:00 New LAPACK Type Routine Lecture 2/27/2002 1:13:00 - 1:20:00 Answering questions from audience Lecture 4/24/2002 0:21:20 - 0:29:00 Linear Classification Lecture 4/01/2002 0:04:30 - 0:10:20 MATLAB Demo Lecture 4/01/2002 0:46:00 - 1:01:00 MATLAB Demo: Sparse Matrices and Graphs Lecture 4/24/2002 0:54:45 - 1:12:00 MATLAB Example Lecture 4/01/2002 0:20:00 - 0:21:00 MATLAB Matrices: Design Principles Lecture 3/06/2002 0:09:00 - 0:30:00 MATLAB*P Demo Lecture 5/08/2002 0:23:45 - 0:25:30 MEMS: Coupling to the Physical World Lecture 2/13/2002 0:59:30 - 1:22:52 MPI Lecture 4/03/2002 1:15:30 - 1:18:40 MUMPS: distributed memory multifrontal Lecture 5/01/2002 1:02:18 - 1:07:10 Master/slave style Lecture 4/01/2002 1:06:10 - 1:12:15 Matching and Block Triangular Form Lecture 4/10/2002 1:15:30 - 1:19:30 Matlab: MPI Lecture 3/04/2002 0:15:00 - 0:32:00 Matlab: Operator overloading; sparse matrices; vectorization Lecture 3/04/2002 0:01:00 - 0:15:00 Matlab: demo Lecture 4/08/2002 0:37:15 - 0:47:15 Matlab: demo Lecture 3/11/2002 0:45:30 - 0:52:00 Matlab: Symbolic example Lecture 3/04/2002 0:32:00 - 0:50:00 Matlab*P overview Lecture 3/04/2002 0:50:00 - 0:57:00 Demo Lecture 4/08/2002 1:21:30 - 1:22:00 Multigrid Multipole Lecture 3/13/2002 0:41:00 - 0:45:00 Code for multipole addition; the Pascal matrix; example Lecture 3/18/2002 1:00:00 - 1:09:30 Experiments with multipole accuracy; sources of rounding error Lecture 3/11/2002 0:07:00 - 0:12:30 Fast multipole: Analogy with finite precision arithmetic Lecture 3/11/2002 0:02:00 - 0:07:00 Fast multipole: quick review; adding functions Lecture 3/18/2002 0:51:30 - 1:00:00 More fun with multipole Lecture 3/06/2002 1:17:00 - 1:26:00 Multipole (Vi(x)=qi/(x-xi)) Lecture 3/06/2002 1:15:00 - 1:17:00 Multipole (global coordinates vs local coordinates) Lecture 3/06/2002 1:08:00 - 1:11:00 Multipole (in 1D, constant potentials) Lecture 3/06/2002 1:11:00 - 1:15:00 Multipole (in 1D, potential= quadratic polynomials) Lecture 3/06/2002 1:26:00 - 1:28:00 Multipole Series Lecture 3/11/2002 0:25:20 - 0:29:15 Multipole as matrix decomposition Lecture 3/13/2002 0:02:25 - 0:10:00 Multipole continued: object-oriented Matlab; exclude2d Lecture 3/13/2002 0:45:00 - 0:50:00 Multipole objects with symbolic entries (!) Lecture 3/11/2002 0:52:00 - 1:04:30 Multipole series (as Taylor series in 1/x) Lecture 3/13/2002 0:25:00 - 0:33:15 Multipole series in Matlab Lecture 3/13/2002 1:23:00 - 1:25:10 Multipole: History and other applications Lecture 3/13/2002 0:55:30 - 1:23:00 Multipole: Overall summary, questions Lecture 3/13/2002 0:50:00 - 0:55:30 Multipole: summing up the multipole sum algorithm Lecture 3/11/2002 1:18:45 - 1:20:10 Summary of the whole fast multipole algorithm Lecture 3/06/2002 0:30:00 - 0:34:00 N-Body Problem Lecture 3/06/2002 0:46:00 - 0:50:00 O(n^2) VS O(nlog(n)) Lecture 3/06/2002 0:40:00 - 0:42:00 O(n^2)? Right? Lecture 3/06/2002 0:42:00 - 0:46:00 Variations Lecture 3/06/2002 0:34:00 - 0:40:00 What is the Computation? Lecture 3/06/2002 0:50:00 - 0:53:00 nlog(n) Type of Computation Lecture 5/01/2002 0:47:00 - 0:47:45 Nabeel Azar introduction Lecture 2/20/2002 0:23:00 - 0:31:00 Node Architecutre Lecture 4/24/2002 0:30:30 - 0:37:30 Non-separable Training Sets Lecture 4/03/2002 0:35:30 - 0:38:40 Nonsymmetric Supernodes Lecture 2/13/2002 0:12:40 - 0:23:30 OpenMP Lecture 2/13/2002 0:23:30 - 0:55:20 Details and example Lecture 2/13/2002 0:55:20 - 0:59:30 Running on our beowulf Lecture 2/25/2002 0:29:00 - 0:39:00 Optimizing Computation and Memoery Use Lecture 4/10/2002 0:03:30 - 0:09:30 Outlines: Embeded Stream Processing Lecture 2/19/2002 1:10:00 - 1:24:00 PRAM Lecture 2/20/2002 1:23:00 - 1:25:00 Paradiso Cafe Problem Lecture 2/06/2002 0:12:15 - 0:19:15 Parallel Architectures Lecture 2/06/2002 0:51:25 - 0:53:00 Moore's law Lecture 2/06/2002 0:19:15 - 0:30:00 architecture details Lecture 2/06/2002 0:30:00 - 0:32:00 more details Lecture 2/06/2002 0:47:18 - 0:51:25 more details, speeds Lecture 2/06/2002 0:42:45 - 0:47:18 more details: SMPs Lecture 2/06/2002 0:32:00 - 0:42:45 more details: diagrams of parallel architectures Lecture 2/06/2002 0:53:00 - 0:59:00 pictures of supercomputers Lecture 4/10/2002 0:09:30 - 0:13:45 Parallel Pipeline Lecture 2/19/2002 0:15:00 - 0:26:00 Parallel Prefix Algorithm Lecture 2/19/2002 1:01:00 - 1:10:00 Parallel Prefix Variations Lecture 3/18/2002 0:01:07 - 0:04:30 Parallel architecture II; caches Lecture 4/10/2002 0:33:00 - 0:38:45 Parallelism Latency and Throughput Lecture 4/22/2002 0:03:30 - 0:05:30 Partitioning: One way to slice a problem in half Lecture 4/22/2002 0:05:30 - 0:12:00 Laplacian of a graph Lecture 4/22/2002 0:12:00 - 0:18:15 Edge-Node Incidence Matrix Lecture 4/22/2002 0:18:15 - 0:27:30 Spectral Partitioning Lecture 4/22/2002 0:27:30 - 0:39:15 Spectral Partitioning: Solve as an eigenvalue problem Lecture 4/22/2002 0:39:15 - 0:46:30 Geometric Methods Lecture 4/22/2002 0:46:30 - 0:50:00 Edge separator and Vertex Separator Lecture 4/22/2002 0:50:00 - 0:52:45 Theory VS. Practice Lecture 4/22/2002 0:52:45 - 0:59:00 Need Theoretical Class of Good Graphs Lecture 4/22/2002 0:59:00 - 1:00:50 Geometric Separator Theorem Lecture 4/22/2002 1:00:50 - 1:08:00 The Algorithm (Step 1 through 6) Lecture 4/22/2002 1:08:00 - 1:18:45 Demo again and Radon Point Lecture 4/22/2002 1:18:45 - 1:20:00 A few tricks Lecture 4/22/2002 1:20:00 - 1:20:45 ParMETIS Lecture 4/10/2002 1:13:30 - 1:15:30 Performance Results Lecture 5/08/2002 0:59:00 - 1:11:00 PolyBot: A Modular Reconfigurable Robot Lecture 4/08/2002 0:59:30 - 1:07:00 Preconditioners Lecture 2/19/2002 0:47:00 - 0:54:00 Prefix Operation Segmented Lecture 4/10/2002 0:28:00 - 0:30:00 Processing Algorithms: Beamforming Lecture 4/10/2002 0:30:00 - 0:33:00 Processing Algorithms: Detection Lecture 4/10/2002 0:21:00 - 0:28:00 Processing Algorithms: FIR overview Lecture 5/01/2002 0:56:26 - 0:57:24 Programming patterns Lecture 3/04/2002 1:25:00 - 1:26:00 Project comments Lecture 5/15/2002 0:01:15 - 0:20:45 Projects: Ahmed Ismail, Cynthia Lo: Parallel off-lattice Monte Carlo simulations Lecture 5/15/2002 0:32:45 - 0:53:00 Projects: Amay Champaneria: Parallelizing condensation for visual tracking Lecture 5/15/2002 0:20:45 - 0:32:45 Projects: Andrew Menard: Parallel clock designer Lecture 5/13/2002 1:16:00 - 1:24:00 Projects: Andrew Wilson, Ashley Predith: Simulation of oxygen ion ordering as a result of temperature change Lecture 5/15/2002 1:12:00 - 1:22:30 Projects: Dean Christakos: Linking Beowulf clusters across the grid Lecture 5/13/2002 0:45:30 - 0:59:30 Projects: Ian Chan: Parallel 2D Kolmogorov-Smirnov statistic Lecture 5/13/2002 0:20:47 - 0:33:00 Projects: Ken Takusagawa: Tabulating values of the Zeta function Lecture 5/13/2002 0:59:30 - 1:16:00 Projects: Matt Craighead: Real-time parallel radiosity Lecture 5/13/2002 0:33:00 - 0:45:30 Projects: Nathan Warshauer: Parallel real-time Strategy AI testing Lecture 5/13/2002 0:00:34 - 0:20:47 Projects: Oskar Bruening, Jack Holloway, Adnan Sulejmanpasic: Matlab*P visualization Lecture 5/15/2002 0:53:00 - 1:12:00 Projects: Per-Olof Persson, Sreenivasa Voleti: Solving very large finite element problems in parallel Lecture 5/15/2002 0:00:00 - 0:01:15 Projects: Start, student project presentations Lecture 5/13/2002 0:00:00 - 0:00:34 Projects: Start, student project presentations: Lecture 4/03/2002 1:05:30 - 1:08:00 Question: preordering for static pivoting Lecture 3/18/2002 1:09:30 - 1:21:56 Questions about Beowulf Lecture 3/20/2002 1:08:00 - 1:20:50 Questions and discussion Lecture 3/18/2002 0:45:40 - 0:51:30 RAW architecture Lecture 3/18/2002 0:39:20 - 0:45:40 The future of cache (according to RAW) Lecture 2/27/2002 1:06:00 - 1:07:00 Recursive Data Format Lecture 4/03/2002 1:18:40 - 1:24:15 Remark on (nonsymmetric) direct methods Lecture 3/11/2002 0:29:15 - 0:32:00 Representing functions: Taylor series Lecture 2/25/2002 1:07:00 - 1:08:00 Results for Parallel Implementation on Intel Delta Lecture 2/20/2002 1:20:00 - 1:23:00 Routing Lecture 4/03/2002 0:53:30 - 0:58:00 Row permutation for heavy diagonal Lecture 4/24/2002 0:12:00 - 0:14:45 SVMs Lecture 2/25/2002 1:26:00 - 1:28:00 ScaLAPACK and MATLAB*P Lecture 2/25/2002 0:43:00 - 0:47:00 Self Adapting Numerical Software Lecture 5/01/2002 0:57:24 - 1:02:18 Single processor, multiple data (SPMD) style Lecture 5/08/2002 0:21:30 - 0:23:45 Smart Matter Vision: A New way to Build ? and Systems Lecture 5/08/2002 0:43:15 - 0:47:45 Smart Matter: Coupling Lecture 5/08/2002 0:14:45 - 0:16:30 Smart Matter: Frontiers in Computation Lecture 5/08/2002 0:57:00 - 0:59:00 Smart Matter: Machine Diagnostics Lecture 4/10/2002 0:49:30 - 1:06:00 Software Framework Lecture 2/25/2002 0:47:00 - 0:53:00 Software Generation Strategy Lecture 4/01/2002 0:34:00 - 0:35:20 Solving Linear Equations: x=A\b Lecture 4/08/2002 1:18:30 - 1:20:30 Sparse approximation Lecture 4/01/2002 0:10:20 - 0:20:00 Sparse Matrices in Real Life Lecture 4/03/2002 0:26:00 - 0:27:30 Sparse Triangular Solve Lecture 2/06/2002 1:09:00 - 1:15:00 Special Approaches Lecture 4/22/2002 0:00:00 - 0:03:30 Start, News on the Japanese fastest computer Lecture 4/24/2002 0:00:00 - 0:12:00 Start, The fastest machine in Japan revisit. Lecture 4/24/2002 1:12:00 - 1:20:00 Structural Risk Minimization Lecture 4/03/2002 0:48:40 - 0:53:30 SuperLU: GE with static pivoting Lecture 4/08/2002 0:00:00 - 0:05:00 Iterative refinement Lecture 4/08/2002 0:05:00 - 0:09:45 Convergence analysis of iterative refinement Lecture 4/03/2002 0:38:40 - 0:40:50 Sequential Lecture 4/03/2002 0:44:40 - 0:47:00 Shared Memory Lecture 4/24/2002 0:14:45 - 0:21:20 Supervised Learning Lecture 4/08/2002 1:20:30 - 1:21:30 Support graph preconditioners: example Lecture 4/03/2002 0:17:00 - 0:21:30 Symmetric Positive Definite: A=R'R Lecture 4/03/2002 0:33:00 - 0:35:30 Symmetric Supernodes Lecture 4/03/2002 1:08:00 - 1:15:30 Symmetric-pattern multifrontal factorization Lecture 4/10/2002 0:39:15 - 0:47:15 System Analysis: Channel Space -> Beam Space Lecture 4/10/2002 0:47:15 - 0:49:30 Dynamic Load Balancing Lecture 4/10/2002 0:38:45 - 0:39:15 System Graph Lecture 3/13/2002 0:01:43 - 0:02:25 Tape running. Project proposal status Lecture 3/13/2002 0:10:00 - 0:23:50 Taylor series in Matlab by operator overloading Lecture 2/19/2002 0:42:00 - 0:47:00 The "Myth" of log n Lecture 4/24/2002 0:29:00 - 0:30:30 The Optimization Problem Lecture 2/25/2002 1:04:00 - 1:07:00 Three Basic Linear Algebra Problems Lecture 5/08/2002 0:16:30 - 0:21:30 Three C's of Computer Science Lecture 5/08/2002 1:11:00 - 1:14:45 Trends in Control: MEMS + Distributed Coordination Lecture 4/10/2002 0:19:30 - 0:21:00 Types of Parallelism Lecture 3/11/2002 1:04:30 - 1:10:00 Virtual charges Lecture 2/11/2002 0:29:30 - 0:36:00 Weather and climate change; weather: history of parallel computing Lecture 2/11/2002 0:47:00 - 1:00:30 activities at MIT Lecture 2/11/2002 0:40:40 - 0:47:00 climate change Lecture 2/11/2002 1:00:30 - 1:09:30 questions Lecture 2/11/2002 0:36:00 - 0:40:40 weather: parallel computing now and future Lecture 5/01/2002 0:30:45 - 0:40:45 Why is it so hard to program parallel computers?