COMPUTER SCIENCE 3366

COURSE SYLLABUS

Spring 2004

COURSE:Introduction to Parallel and Distributed Processing

INSTRUCTOR: Dr. Maurice L. Eggen

OFFICE: Halsell 339A

OFFICE HOURS:
8:00-9:30, 10:30-11:30 MWF
8:00-8:30, 9:45-11:30, 2:00-3:30 TR
Others by appointment

MEETING HOURS AND ROOM:
CSCI 3366: 3:35-4:50 TR, Halsell 340.

TEXT MATERIALS: Wilkinson and Allen, Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers, Prentice Hall Publishers, 1999

COURSE: This course is an introduction to parallel and distributed processing. Course content will include learning the theory as well as application of parallel processing concepts. Content will include parallel machines, parallel machine models, parallel algorithm development, parallel algorithm design, parallel algorithm analysis.

PREREQUISITE: CSCI 2320 or consent of instructor

COURSE GOALS AND OBJECTIVES: The objectives of this course include, but are not limited to, the following:

LABORATORY PROBLEMS: Several homework laboratory problems will be required for successful completion of this class. Problems will be coded in using a suitable tool for parallel implementation. Additional requirements include one significant semester project. The semester project must be approved by the instructor and demonstrated to the class. The semester project must be a formal paper including complete documentation and program code.

GRADES: The grades in this class will be determined by the results of two major examinations, given at approximately equal intervals in the semester, by the results of periodic quizzes, by the results of the laboratory assignments discussed above, and by the semester project. Each of the two examinations will be approximately equally weighted, including the final, which will be given during the final examination week, and will serve as the second examination. Each of the laboratory assignments will be worth a variable number of points, depending on difficulty. Quizzes will be given weekly. Averages will be calculated as a simple percentage, points earned divided by points possible. Letter grades will be assigned according to the following scale:
with plus and minus grades assigned in marginal cases. I advise you to keep track of your scores so you know where you stand in the class at any time.

EXAMINATION DATES:
Midterm Examination: March 4, 2004
Final Examination: Final Examination Week, Tuesday, May 11, 8:30-11:30pm, As Scheduled by the University

Reading Days: Reading Days for the spring 2004 semester are May 3,4, 2004. Since Reading Days are for the purpose of providing students with study time prior to final examinations, no classes are held on those days. Also, no major paper may be due and no major examination may be given on the two days prior to the Reading Days.

NOTES:

1. Regular class attendance is required. Role will be taken and attendance is considered mandatory. Excessive absences will be reported to you and to appropriate university officials and may cause you to be withdrawn from the class. Each student is allowed two absences without penalty. Beyond that, each unexcused absence will result in a penalty of two percentage points from your final average. Excused absences require a note from the appropriate university offical or from appropriate medical personnel.

2. Homework assignments that are identical beyond coincidence are in violation of the Academic Integrity policy of the university and will result in disciplinary action, including, but not limited to a failing grade on that assignment for all parties involved. You are responsible for the security of your work, both electronic and hard copy.

3. Discussion of the homework assignments between students is encouraged, but when it comes time for the final submission, make sure it is your own work. You are cheating yourself if you get the homework from some source other than creating your own.

4. Homework will be due at the beginning of the class period on the day assigned. LATE WORK WILL NOT BE ACCEPTED. Make sure you resolve problems with printing, workstations, communication, etc. IN ADVANCE so your work may be submitted in a timely manner. Homework will NOT BE ACCEPTED FOR CREDIT if submitted late. Those of you who submit work late penalize the conscientious students who turn in their work on time.

5. The only exceptions to these policies are for University sanctioned activities or illness and require a note from your supervising professor (coach) or doctor. If you have unusual circumstances (as we all sometimes do) please discuss these with your instructor in advance.

ADDITIONAL REFERENCES:

Foater, Designing and Building Parallel Programs Addison Wesley publishers

Steven Brawer, Introduction to Parallel Programming, Academic Press, 1989 Benjamin Cummings, 1992, Second Edition

Sobell, A practical Guide to the Unix System, Benjamin Cummings, Third Edition, 1995

K. N. King, C Programming, A Modern Approach, Norton Publishers, 1996

Selim Aki, The Desing and Analysis of Parallel Algorithms, Prentice Hall, 1989

Cormen, Leiserson, and Rivest, Introduction to Algorithms, McGraw Hill, 1990.

Cosnard and Trystram, Parallel Algorithms and Architectures, PWS, 1995.

Codenotti and Leoncini, Introduction to Parallel Processing, Addison Wesley, 1993.

Berman and Paul, Fundamentals of Sequential and Parallel Algorithms, PWS, 1997.

Al Geist et.al., PVM Parallel Virtual Machine, A Users Guide and Tutorial for Networked Parallel Computing, The MIT Press, 1994,

William Gropp, Ewing Lusk, and Anthony Skjellum, Using MPI. Portable parallel Programming with the Message-Passing Interface, The MIT Press, Fifth Printing, 1999

Marc Snir, et. al., MPI-The Complete Reference. Volume 1, The MPI Core, The MIT Press, Second Edition, 1998

William Gropp et. al., MPI-The Complete Reference, Volume 2, The MPI Extensions, The MIT Press, 1998

Return to Dr. Eggen's Home Page