This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 7. Extra Credit: In class (on Feb 3) we will complete our analysis of our simplest divide-and-conquer algorithm for matrix multiplication (the one that reduces n-by-n matrix multiplication C = A B to 8 multiplications and 4 additions of n 2-by-n 2 matrices), and show that it only moves O ( n 3 /M 1 / 2 ) words between main memory and a cache of size M < n 2 . An analgous analysis can be done for Strassens method, showing that it only moves O ( n /M x ) words, where = log 2 7 2 . 81, and x is another constant. What is x ?...
View Full Document
This note was uploaded on 04/30/2010 for the course CS 170 taught by Professor Henzinger during the Spring '02 term at University of California, Berkeley.
- Spring '02