CS 680 High Performance Computing

 Announcments  Lectures  Programs  Course Resources  Assignments & Solutions  Grading Policy
Course Description
Covers the design, evaluation and use of high-performance processors, including instruction set architecture, pipelining, superscalar execution, instruction level parallelism, vector instructions, memory hierarchy, parallel computing, and high-performance I/O. Special attention is given to the effective utilization of these features, including automated techniques, in the design and optimization of performance-driven software.
Course Objective
Familiarity with advanced features of computer architecture designed to improve performance. Ability to tailor software to more effectively utilize these features. Proficiency at measuring and analyzing the performance of software on a given architecture.
(CS260 Data Structures), (CS281 Systems Architecture I), (CS282 Systems Architecture II), (MATH221 Discrete Mathematics) or equivalent undergradaute courses.
Jeremy Johnson
Office: 271 Korman Center
phone: 895-2893
e-mail: jjohnson@cs.drexel.edu
office hours: M 3-6, R 3-5. Additional hours by appointment.
Meeting Time
M 6:00-9:00 in Matheson 304
  1. Kevin Dowd and Charles Severance, High Performance Computing, Second Edition, O'Reilly, 1998.


  1. Assignments 30% (3 at 10)
  2. Quizzes 30%
  3. Final Project 40%

Final grades will be determined by your total points weighted according to this distribution. Grades will be curved based on relative student performance. Students who successfully complete all of the homework and do reasonably well on the exams should receive a B. Students with high exam and project scores and who do well on the assignments will receive an A.

All assignments must be completed alone unless otherwise stated. No Late assignments will be accepted without prior approval.


Reference Books
  1. More to be added.
Web Pages
Other Reference

Look Here for Important Announcements

Announcements (Thur. Nov. 30 @ 9:50pm)


This list is tentative and may be modified at the instructor's discretion.
  1. Jan. 5, 2004 (Course Introduction and Overview)
  2. Jan. 12, 2004 (Instruction Count Model)
  3. Jan. 19, 2004 (University Holiday- NO CLASS)
  4. Jan. 26, 2004 (Memory Hierarchy)
  5. Feb. 2, 2004 (Walsh-Hadamard Transform Algorithms)
  6. Feb. 9, 2004 (Walsh-Hadamard Transformm Performance Models)
  7. Feb. 16, 2004 (University Holiday - NO CLASS, Take-Home Midterm Exam instead)
  8. Feb. 23, 2004 (Transposition, Loop Interleaving, and the WHT)
  9. Mar. 1, 2004 (Program Optimization)
  10. Mar. 8, 2004 (Parallel WHT Algorithms and Implementation)
  11. Mar. 15, 2004 (Project Presentations)



Exam Studyguide


Created: 12/29/03 by jjohnson@cs.drexel.edu