Handouts: Syllabus, book list and massively-slugfull computing.
Topics: Overview, Typing injury FAQ home page.
Homework: Parallel Prefix, 2.1, 2.2
Topics: PRAM, NC, theory
Homework: 2.19, 3.5
Topics: Network characteristics, basic communication algorithms
Homework: 3.8, 3.15, 3.16
Topics: Communication
Homework:
Topics: MPI
Comments: DEC MPI is located at /usr/opt/MPI140/ (links also exist in /usr/bin for mpiclean, mpiproc, and mpihost) and it includes a user's guide. There are also copies of mpich and lam in /projects/kestrel/programs. The lam directory is compiled for sparc and includes the graphical xmpi program. The lamalpha directory is for the alphas. The full transparencies and other documentation (you probably don't need to print these out!) are in /projects/kestrel/programs/mpiinfo. Note that in MPICH, it is possible to generate and view a log file with -lmpi -lpmpi -lm which can be viewed with upshot and nupshot.
Homework: Finish up MPI programming.
Topics: Systolic algorithms.
Comments: Beta appears to be more stable than Alpha for use with the DEC MPI implementation. Osama to bring a snack.
Homework: 12.1, 12.6, 12.9, 12.8, 12.10, 12.11, 12.13.
Topics: MPI, Convolution and n^3 DP
Comments: Download ARVLSI paper.
Topics: Systolic n^3 DP, DNA computation
Homework: For 5/19: 9.3, 9.4, 9.6, 9.7. For 5/14: One-sentence project proposal.
Topics: Kestrel
Topics: Kestrel, reduced space DP.
Topics: Reduced space DP, DP (chapter 9)
Homework: Short project writeup (2-3 pages) due 5/19. For Thrusday: (1) 9.5, (2) What attributes of the sequence analysis DP allows checkpointing? What types of DP would checkpointing not work for? Where does checkpointing fall in serial/nonserial, monadic/polyadic?
Also take a look at (and preferably solve).... 7.2 and 7.3
And decide on a simple problem (from this chapter or some other) to try out on Kestrel and MPI that you haven't yet (this part will be due on the 28th, and will include some performance analysis).
Homework: 7.7, 7.10. 7.11, 7.12
Topics: Graph algorithms: MST, Dijkstra,.
Homework: Multiply two polynomials with DFT.
Topics: Dijstra all pairs, Floyd's algorithm, DFT.
Homework: 10.4 (Linear FFT)
Topics: FFT
Homework: What is the order of an unordered FFT? How long would it take to reorder in linear, mesh, hypercube?
Topics: FFT and parallelization.
Topics: Probabalistic parallel algorithms
Topics: Bitonic merge sort (same data movement as FFT!)
Homework: Midterm replacement due Monday the 15th.
Topics: Project talks from David (3-level checkpoints), Justin (S&W dynamic programming).
Topics: Project talks from Liz (K1 compiler), Brian (Hopfield Nets), Eric (Division), and Osama (All-pairs shortest path on Kestrel).
Homework: Project due at 2:00pm.
Comments: Seventh Annual Parallel Processing BBQ at 3:00 pm at Natural Bridges State Park. Here are descriptions of the Park's geology.