CS4163: Parallel Algorithm Analysis & Design, Spring 2003
- Instructor: Ed Luke
- Office: Butler 330 (or Engineering Research Center 220)
- Office Hours: 3:30pm-5:00pm T TH(Or by appointment)
- Meeting Place: Butler 100
- Meeting Time: 2:00pm-3:15pm T TH
- Web Site: http://www.cs.msstate.edu/~luke/Courses/sp03/CS4163
- Instructor E-Mail: luke@cs.msstate.edu
- Formal Content Description
- Course Topics:
- Parallel Programming and Performance Models
- Amdahl's Law
- PRAM (CREW and EREW)
- Network Models (Hypercube, Mesh, Fat Trees, Crossbar, Ring)
- Bulk Models (LogP and BSP)
- Parallel Programming Patterns
- Bag of Tasks
- Data Parallel
- Reduction (global and local)
- Pipelining
- Divide and Conquer
- Scalability Metrics
- Isoefficiency
- Cost Optimality
- Optimal Effectiveness
- Parallel Programming Algorithms
- Matrix Operations
- Sorting
- Sorting Networks
- Bubble Sort and variants
- Quicksort
- Bucket Sort
- Radix Sort
- Convex Hull
- Required Text: Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers, by Barry Wilkinson and Michael Allen
- Text and References
- Class Notes
- Grading:
-
Theoretical Assignments: 10%
Each missed theoretical assignment will drop 1 point.
- Programming Projects : 30%
- First Project: Broadcast Algorithms project2.tar Due March 6th
- Second Project: Parallel Sorting project3.tar Due Thursday April 24th (Extra credit work will be accepted up to 30th of April)
- Project Report:
This is a research project, not just a programming assignment. I
expect to receive, in addition to any program source developed, a
comprehensive report that documents:
- Background Material Researched in Support of the Project
- Techniques and Methods used in the Report
- Results presented in sufficient detail that the results are reproduce-able from the description
- Analysis: What are the lessons learned. What general principles can be observed from the results.
- ALL NON-ORIGINAL work must be cited!
- No mercy will be given to students that submit plagiarized
material. Any student that submits the work of others represented as
their own will face disciplinary sanctions!
- 2 Partial Exams: 40%
- First Partial Exam: Covering Performance models, broadcast algorithsm and scalability analysis, Tuesday February 25th
- Second Partial Exam: Covering Sorting Algorithms, Thursday, April 3rd
- Comprehensive Final Exam: 20%
-
Final Examination on May 7th (Wednesday) 12:00pm-3:00pm.
- Covers all of material from test #1 and test #2 plus dense matrix algorithms. See Final Outline
-
Programming Project Grading Policy:
-
Difficulty: Undergraduates get a break ! Easier options/algorithms.
-
Individual Efforts: Team participation is not encouraged, unless otherwise stated.
-
Submission: E-mail attachments sent to instructor
-
Submit all source and include files and makefiles
-
Do not submit binaries PLEASE !!!. Repeat offenders will face penalties.
-
Partial credit given to non-functional programs
- Academic Honesty:
- The Departmental policy is a must-reading for all students.
- All web material used should be acknowledged otherwise you
are culpable
- Remember, if caught -- NO EXCEPTIONS, NO MERCY.
luke@cs.msstate.edu
Last modified: Mon Apr 28 09:52:35 CDT 2003