|08/29/2011||This term we will be using Piazza for class Q&A. The system is highly catered to getting you help fast and efficiently from classmates, and from Jim and Oded. Rather than emailing questions to the teaching staff, we encourage you to post your questions on Piazza. Find our class page at: http://www.piazza.com/berkeley/fall2011/cs29476.|
|10/3/2011||Next Friday we plan to visit NERSC. We meet at the Downtown BART at noon and take the 12:10 train to 19th St. Oakland (arriving 12:19pm).
We will hear a 30 min presentation on NERSC, and tour the NERSC machine room. We intend to catch the 1:38pm back to Downtown Berkeley (arriving 1:47pm).
Important notice: we need to provide a list of names of all students visiting the center to OSF Security. If you intend to participate in this tour, but you are not officially registered to this course, please email your name to Oded. If you are registered, no action is required.
|10/12/2011||If some of the students have trouble making the 12:10 Downtown Berkeley BART, they should be fine on the next one. Everyone needs to checkin to the center, with a photo id. To allow some time for that and to avoid bottleneck, please try to make it to the earlier train.|
|10/18/2011||Students who need accounts at NERSC (for final class projects purpose) may use the follow link:
|10/27/2011||If you have not yet picked up a topic for your project or presentation, please: send Oded a short email, stating your choice until the end of this week, and email Oded a one page description of your planned project by next Friday Nov. 4.|
|11/08/2011||The deadline for submitting CS294 projects is the last week of this term, December 2. We will have a posters presentation the following Friday, December 9, 12-2pm. If you have presented a paper in class and have not done a project beyond that, you can present a poster version of your slides. We will start the event with a very short (2 minutes) presentation of each poster. If you want more time than that, please email Oded, so we can schedule your talk in one of the few remaining spots.|
Correction: the deadline for submitting CS294 projects is end of the day Friday of the poster session.
The poster session remains on Friday, December 9, 12-2pm.
For poster printing instructions and a poster template you can look here: http://parlab.eecs.berkeley.edu/wiki/printers/pls562p. If you prefer preparing your poster using latex and need a template, please email Oded.
Many students will be using the posters printer (for our course and other courses). To avoid contention, you may want to print your poster ahead of times.
|08/26/2011 12-1pm||Jim||Introduction to communication-avoiding algorithms|
|08/26/2011 1-2pm||Oded||Communication costs lower and upper bounds: reductions|
|09/02/2011 12-2pm||Oded||Communication costs lower and upper bounds: geometric embedding|
|09/09/2011 12-2pm||Jim||CA algorithms for dense linear algebra: matrix multiplication and LU decomposition|
|09/16/2011 12-2pm||Jim/Oded||CA algorithms for dense linear algebra: LU, QR, and Cholesky decompositions, and sparse Cholesky decomposition|
|09/23/2011 12-1pm||Edgar||2.5D algorithms: from hardware to theory and back|
|09/23/2011 1-2pm||Aydin||Communication in sequential and parallel BFS|
|09/30/2011 12-12:50pm||Andrew & Grey||Algorithms and lower bounds for heterogeneous models: minimizing communication, saving energy|
|09/30/2011 12:50-1:15pm||Jim||Potential Projects|
|09/30/2011 1:15-2pm||Oded||Communication costs lower and upper bounds: graph analysis|
|10/07/2011 12-1pm||Derrick||Selective, Embedded Just-in-Time Specialization (SEJITS)|
|10/07/2011 1-2pm||Sam||The roofline model|
|10/14/2011 12-2pm||.||Visiting NERSC: National Energy Research Scientific Computing Center, at Berkeley Lab's Oakland Scientific Facility (OSF).||.|
|10/21/2011||Erin/Nick||Avoiding Communication in Sparse Iterative Solvers|
|10/21/2011||Nick||Avoiding Communication in Sparse Matrix-Vector Multiply (SpMV)|
|10/21/2011||Erin||Introduction to Blocking Covers|
|10/28/2011 12-1pm||Mike||Communication Lower Bound for the Fast Fourier Transform|
|10/28/2011 1-2pm||Vasily||Experience in accelerating linear algebra using GPUs|
|11/04/2011 12-1pm||Ben||CA parallel implementation for fast matrix multiplication||.|
|11/04/2011 1-2pm||Oded||Maximizing communication|
|11/18/2011 12-1pm||Jim||Further techniques for arithmetic costs and communication costs lower bounds||.|
|11/18/2011 1-2pm||Oded||Towards communication avoiding algorithm for fast multiplication of sparse matrices. Part I: arithmetics.|
|12/02/2011 12-1pm||Bor-Yiing||clOSKI: An OpenCL SpMV autotuner on GPU platforms|
|12/02/2011 1-2pm||Razvan||Communication costs of LU decomposition algorithms for banded matrices|