|
|
|
CMSC 431: Parallel Computing
Description: This course is an introduction to
parallel algorithms and parallel architectures. The central focus will be the application of
parallelism in order to speed the solution of computational problems. Such problems will
include sorting, matrix operations, graph traversal, and image analysis. Time will be devoted
to certain specialized parallel architectures such as grids, hypercubes, and butterfly and De
Bruijn-type networks.
Professor:
Robert W.
McGrail
Class Meeting: Monday and Friday, 10:30-11:50 AM, Olin 309
Lab Period: Wednesday, 9:50-11:50 AM, Albee 314
Text:
Introduction to Parallel Computing, Second Edition.
Grama, Ananth, et al. Addison-Wesley. 2003. ISBN: 0-201-64865-2. |
|
Course Policies
Class Meetings: These will be conducted as a
problem-and-answer seminar, rather than a lecture series. Homework will be assigned in advance of
the relevant class meetings. Students will discuss their solutions to complex problems, and receive
immediate feedback for their ideas. Impromptu lecture will occur only in response to general
questions and/or perceived misconceptions.
Lab Meetings: The laboratory sessions will be held as a
computing studio. That is, students will be given general, long term goals and multiple weeks in
which to achieve those ends. The weekly lab period is a time in which your projects will receive my
undivided attention. It is expected that each of you will devote many more hours per week to your
lab projects.
Exams: There will be two exams. Both exams will carry the
same weight.
Grading: The grading breakdown will be as follows.
- Class Solutions: 40%
- Lab Projects: 30%
- Exams: 30%
|
Syllabus
The following topics will be covered in this course.
- General Parallel Computing Architectures
- Special Topologies: Arrays, Trees, Hypercubes, Meshes, Benes and Butterfly Networks, etc.
- Parallel Algorithm Patterns and Design
- Processor Communication
- Performance Measurement
- The Message Passing Interface (MPI)
- Matrix Algorithms
- Sorting
- Graph Algorithms
There are several other subjects that might be included. They
will likely be restricted to the following list. Moreover, the choice of additional topics
will be subject to student input.
- Tuple Spaces
- Search Algorithms
- Dynamic Programming
- The Fast Fourier Transform
|
|
News
Laboratory Project II
11/10/06 - Construct and run MPI matrix programs on your new cluster.
Midterm Exam
10/22/06 - Please read and present the research papers assigned to you by me.
Homework Assignment 4
9/22/06 - Exercises 3.1-3.4. Due: Friday, October 6th.
Homework Assignment 3
9/15/06 - This covers September 22nd through 25th, 2006. Each student will have their own collection of exercises. For further details ...
Homework Assignment 2
9/9/06 - Page 79, exercises 2.12 through 2.15. This is for the week of September 11-15.
|
Accessible Version
Imprint