CS 442; Introduction to Parallel Processing; Spring 2006

Instructor

Barney Maccabe home page, email

Phone

277-6504

Office

EECE 236B

Office hours

10–11 MWF & by appointment

Textbook

Introduction to Parallel Computing (2nd Edition) by Grama, Gupta, Karypis, and Kumar, Addison-Wesley, 2003.

Course Description

Machine taxonomy and introduction to parallel programming. Performance issues, speed-up, and efficiency. Interconnection networks and embeddings. Parallel programming issues and models: control parallel, data parallel, and data flow. Programming assignments on massively parallel machines.

Class meetings

Mitchell Hall 221; Monday, Wednesday, Friday 11-12. Students are required to attend all lectures. If you miss a lecture, you should make arrangements with a student who did attend the session to find out what you missed.

Dates

Topic

Reading

1/18–1/20

Introduction

Chapter 1

1/23–1/27

Parallel Platforms

Chapter 2

1/30–2/3

Parallel Algs

Chapter 3

2/6–2/10

Programming

2/13–2/17

Communication Operations

Chapter 4

2/20–2/24

Analytical Modeling

Chapter 5

2/27–3/3

Message Passing Programming

Chapter 6

3/6–3/10

Catch up & Midterm Exam

3/13–3/17

Spring Break

3/20–3/24

Shared Address Space Programming

Chapter 7

3/27–3/31

Catch up

4/3–4/7

Dense Matrix Algorithms

Chapter 8

4/10–4/14

Sorting

Chapter 9

4/17–4/21

Graph Algs

Chapter 10

4/24–4/28

Catch up

5/1–5/5

FFT

Chapter 13

5/10

Final Exam 10:00–noon

Homework Assignments

Throughout the semester, exercises will be assigned from the textbook. Homework will constitute 20% to your grade.

Programming Assignments

There will be three or four programming assignments during the semester, which will constitute 40% of your grade.

Exams

There will be a midterm exam and a (cumulative) final exam. The midterm will constitute 15% of your grade in the class.

The final exam is Wednesday, May 10th from 10:00 until noon. The final exam will constitute 25% of your final grade.