CS4163: Parallel Algorithm Analysis & Design, Spring 2004
- Instructor: Ed Luke
- Office: Butler 330 (or Engineering Research Center 220)
- Office Hours: 3:30pm-5:00pm T TH
- Meeting Place: Butler 100
- Meeting Time: 2:00pm-3:15pm T TH
- Web Site: http://www.cse.msstate.edu/~luke/Courses/sp04/CS4163
- Instructor E-Mail: luke@cse.msstate.edu
- Formal Content Description
- Course Topics:
- Parallel Architecture Overview
- Pipelining and Superscalar Execution
- Cache systems
- Strategies for hiding latency and increasing bandwidth
- 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: Introduction to Parallel Computing: Second Edition, by Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar
- Text and References
- Class Notes
- Grading:
-
Theoretical Assignments: 10%
Each missed theoretical assignment will drop 1 point.
- 3 Partial Exams: 40%
- First Partial Exam: [ test 1 outline ] Test on Tuesday February 24th
- Second Partial Exam: [ test 2 outline] Test on Thursday April 15th
- Third Partial Exam: (Will be part of Final exam, outline soon.)
- Comprehensive Final Exam: 20%
-
Final Examination
- Outline for Final Exam Material
- Covers all of material from test #1, #2, and #3.
- Final on 12:00-3:00pm, Friday, May 7th
- Final will include Test 3 portion that covers sorting and matrix operations.
- Final grade will replace lowest test grade if final is higher.
- Programming Projects : 30%
- First Project: Search for Inteligent Puzzles (SIP) [ project1.1.tar] [ project1_job_scripts.tar] [ project1_extra_datafiles.tar.gz] Due: Tuesday Feb 17th. Notice: Updated tar file includes new job scripts, Due date moved to Feb17th!
- Second Project: Basic Communication Operations [ project2.tar ], Due date: Tuesday, March 30th
- Third Project: Parallel Sorting [ project3.tar ], Due date: Thursday, April 29th
- 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!
-
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@cse.msstate.edu
Last modified: Tue Apr 27 15:53:38 CDT 2004