PARALLEL COMPUTER ARCHITECTURE PPT,PDF
Instructor: Russell Tessier,
Textbook (Required): Parallel Computer Architectures: A Hardware/Software Approach , by David Culler, JaswinderPal Singh, and Anoop Gupta, Morgan-Kaufman, 1999, ISBN: 1-558-603433. Textbook Errata
Instructor: Russell Tessier,
Course Description
Parallel processing has matured to the point where it has begun to make a considerable impact on the computer marketplace. This course seeks to equip students to specify, design, and evaluate parallel architectures for special-purpose and general-purpose applications. The course will devote special attention to compiler techniques for parallel machines. The course will begin with discussions of several typical numeric and combinatorial applications and focus on one or more of them to concretely illustrate the tradeoffs in application implementation. Students will then be shown how to classify parallel machines, with a discussion of the issues in controlling and programming in each class. Then follows a discussion of general-purpose multiprocessors. This includes a detailed study of interconnection networks such as hypercube, butterfly, and mesh. We will then perform a detailed study of cache coherency procedures for multiprocessors. The course will be closed with an analysis of compiler technology for parallel computers including loop tiling, data partitioning, processor allocation, and data alignment. Students will be provided with readings from the technical literature, to expose them to the state-of-the-art, and also to train them in the art of reading papers from research and development journals.Textbook (Required): Parallel Computer Architectures: A Hardware/Software Approach , by David Culler, JaswinderPal Singh, and Anoop Gupta, Morgan-Kaufman, 1999, ISBN: 1-558-603433. Textbook Errata
| Event | Topics | Notes | Homework |
| Lecture 1 | Course Introduction | | |
| Lecture 2 | Architectural Perspective | | |
| Lecture 3 | Design Issues | ||
| Lecture 4 | Parallel Applications | | |
| Lecture 5 | Grid Computations | ||
| Lecture 6 | Programming for Performance | | |
| Lecture 7 | Resource Balancing I | | |
| Lecture 8 | Resource Balancing II | no notes | |
| Lecture 9 | Workload Evaluation | ||
| Lecture 10 | Graph Applications | | |
| Lecture 11 | Static Routing Architectures | | |
| Lecture 12 | Interconnection Network Performance | | |
| Lecture 13 | Shared Memory Multiprocessors I | ||
| Lecture 14 | Shared Memory Multiprocessors II | no notes | |
| Lecture 15 | Mid-Term Review | | |
| Lecture 16 | Interconnection Topologies | | |
| Lecture 17 | Memory Systems | ||
| Lecture 18 | Scalable Parallel Caches | | |
| Lecture 19 | Processor Design | | |
| Lecture 20 | Evaluation and Message Passing | ||
| Lecture 21 | Routing | | |
| Lecture 22 | Guest Lecture on Interconnect: Prof. W. Burleson | | |
| Lecture 23 | Parallel Compilation | | |
| Lecture 24 | Adaptive System on a Chip | | |
| Lecture 25 | Final Exam Review | | |
| Lecture 26 | Reconfigurable Computing | | |
| Lecture 27 | Course Wrap Up | |
No comments:
Post a Comment