CSCI 3366 (Introduction to Parallel and Distributed Processing):
Lecture Summaries

• January 9: About the course.
• January 11: "Why parallelism?"; basic models of parallel computation.
• January 16: Multicomputer architecture; "how fast can we go?"
• January 18: Parallel computing with message-passing.
• January 23: Parallel computing with message-passing, continued.
• January 25: Parallel program design; embarrassingly-parallel computations.
• January 30: Embarrassingly-parallel computations.
• February 1: Embarrassingly-parallel computations.
• February 6: Divide-and-conquer computations.
• February 8: Divide-and-conquer computations.
• February 13: Divide-and-conquer computations.
• February 15: Divide-and-conquer computations.
• February 20: Divide-and-conquer computations.
• February 22: Exam 1.
• February 27: No class.
• March 1: Pipelined computations.
• March 6: Synchronous computations.
• March 8: Synchronous computations, continued.
• March 13, 15: Spring break.
• March 20: Load balancing and termination detection.
• March 22: Shared-memory programming.
• March 27: Shared-memory programming, continued: POSIX threads.
• March 29: Shared-memory programming, continued.
• April 3: Shared-memory programming, continued.
• April 5: A little about performance tuning; shared-memory programming, continued.
• April 10: No class.
• April 12: Shared-memory programming, continued.
• April 17: Shared-memory programming, continued.
• April 19: Parallel program design, revisited.
• April 24: No class.
• April 26: Exam 2.