George Mason University
DEPARTMENT OF COMPUTER SCIENCE
CS699 - Advanced Topics / Parallel Algorithms [Distributed Algorithms] - Spring 2004
Wednesday 7:20-10:00, Innovation 316
Prerequisites |
Description |
Readings |
Syllabus |
Grading |
Late |
Dates
TA and Instructions for Mailing List
This page last updated on 1/14/04.
Professor Dana Richards
703-993-1545
richards@cs.gmu.edu
Course office hours: Tuesday and Wednesday 11:00-12:00 or by appt.
Sci&Tech II Room 425
PREREQUISITES :
CS583 or equivalent background in algorithms.
DESCRIPTION :
The emphasis will be on the design of asynchronous algorithms, their analysis
and proofs of correctness.
READINGS:
- Distributed Algorithms, Nancy Lynch, 1996.
SYLLABUS:
The pace can not be predicted.
We should cover most of chapters 1-4, 8-9, 13-15, 17, and other chapters as time permits.
GRADING :
Homework -- 70%
Presentation -- 30%
Most every week a few homework problems will be assigned.
These will be collected and graded.
There will be an in-class presentation near the end of the semester.
The topic, chosen by agreement between the student and professor, can
be a more in-depth treatment of a prior topic, or come from areas not
yet covered in lecture.
There is to be NO group work on graded work.
LATENESS:
Homework will be marked down 25% each week they are late.