next up previous
Next: Survey-based Term Project Up: root Previous: root

Syllabus

CSc 8530 $\mbox{Sushil K. Prasad}$
Spring, 2015
Course Syllabus

Course Title:
Parallel Algorithms

Prerequisites:
Csc 4520/6520 Design and Analysis of Algorithms. (Or, CSc 4310/6310 Parallel and Distributed Computing)

Instructor:
Sushil K. Prasad; Room 717, 25 Park Place; (Do not leave phone messages - send email instead). Email sprasad@gsu.edu.

Class Time and Place:
(1:00-2:45, MW, Sparks 328) Rescheduled Wed 8:30-12 in Room 755, 25 Park Place (Suntrust Bldg.)

Office Hours:
Wed 2:00-3:30 p.m. Office hour may be cancelled occasionally due to academic meetings.

GTA/Office Hours:
Michael Mcdermott;
Mon 10:30-12:30; Fri 12:30-2 Room 650 cubicles at Suntrust
Email: mmcdermott2@student.gsu.edu

Content:
The goal is to study various design techniques and representative algorithms on shared memory and network models of parallel computation, and, possibly, a few emerging topics in distributed and network computing arena. Topics may include algorithms for sorting, searching, selection, trees, graphs, data structures, etc., and new and emerging models and applications.

References:
  1. Text: Akl, Parallel Computation, Model and Methods, Prentice Hall, 1997 - out of print, but author has allowed to make copies for class use.
  2. S. Rajasekaran and J. Reif, Handbook of Parallel Computing: Models, Algorithms and Applications, Chapman and Hall/CRC, 2008.
  3. J'aJ'a, J., An Introduction to Parallel Algorithms, Addison-Wesley Pub Co, Reading, MA, 1992.

  4. F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, CA 1992.

  5. J. H. Rief, Synthesis of Parallel Algorithms, Morgan Kaufman, San Mateo, CA, 1993.

Attendance:
You may be dropped if you have more than one absence. Students are responsible for all the material covered or assigned (whether or not in the text).

Withdrawals:
If you withdraw by the published withdrawal date then you may get a grade of `W.'

Grading Policy:
Homework and Seminar Presentations 30%  
Term Project and Presentation 50%  
Final Project Due One Week before last day of class;    
     
Project Presentation: last few weeks    
Quiz/Test(s) 20%  

See sample projects, etc., on course website http://www.cs.gsu.edu/~ cscskp/teaching/node4.html

Any absence from scheduled seminar presentations must be arranged with the instructor at least two weeks in advance; it remains the responsibility of the absentee to find his/her replacment.

Final grade would be relative to the class performance. To ensure a grade, however, 90 and above will result in a grade of `A,' 80-89 a `B,' 70-79 a `C' and 65-69 a `D.' There will be zero credit for late submissions. Incomplete projects and assignments will not be accepted.

Disclaimer:
The course syllabus provides a general plan for the course; deviations may be necessary.




A teacher can never truly teach unless he is still learning himself. A lamp can never light another lamp unless it continues to burn its own flame. The teacher who has come to the end of his subject, who has no living traffic with his knowledge but merely repeats his lesson to his students, can only load their minds, he cannot quicken them.

Rabindranath Tagore, Indian Poet

Nobel Laureate in Literature, 1913


next up previous
Next: Survey-based Term Project Up: root Previous: root
Sushil_Prasad 2015-01-26