Parallel Algorithms & Architectures

CS 315
Spring 1999

Thomas P. Kelliher
Hoffberger 140
Office phone: 337-6189
Home phone: 931-2946
Send mail to kelliher AT DOMAIN
Office hours: MWF 9:00--10:00am. Th 12:00-2:00pm. Other times by appointment.

Hoffberger 123
MWF 1:30--2:20pm
Three credits.

This course is an introduction to the field of parallel algorithms and architectures. We will study parallel computation involving the most popular network architectures: arrays, trees, and hypercubes. Emphasis will be placed on the basic principles of parallel algorithm design (including prefix computation, divide and conquer, pointer jumping, Fourier transform, matrix multiplication, packet routing, and sorting) and how they are applied to applications such as sorting and counting, arithmetic, matrix computations, graphs, packet routing, image analysis, and computational geometry.

F. T. Leighton, ``Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes,'' Morgan Kaufmann, 1992. Required.

Grade Distribution

A = [92--100], A- = [90--92), B+ = [88--90), B = [82--88), B- = [80--82), etc.

Course Point Distribution

There are tentatively 550 total points for the course:

  1. Assignments --- There will be approximately five written assignments. Each assignment will be worth 50 points. Late assignments will be accepted only by prior arrangement.

  2. Exams --- There will be two midterms and a final. Each midterm will be worth 75 points. The final will be worth 100 points. Tentatively, the midterms will be February 19 and April 9.

  3. Attendance, participation. 50 points.

Course Handouts:

Most course handouts will be made available once in class. After that, they may be obtained from the class home page on the World Wide Web (see the class URL above). Some course handouts will only be distributed through the class home page.

Attendance of classes is expected and is a part of your grade. It is your responsibility to catch up on missed class work.

Academic dishonesty will not be tolerated. We are all bound by the Academic Honor Code.

Thomas P. Kelliher
Tue Jan 19 10:36:09 EST 1999
Tom Kelliher