| Instructor |
Jayadev Misra office: TAY 3.102 email: misra@cs.utexas.edu phone: 471-9550 office hours: MW 2:30-3:30P or by appointment |
||||
| Teaching Assistant |
Andrew Matsuoka Office hours: TA station is #1 in ENS 31NQ Tues 11AM-12PM Thurs 12:30-1:30PM email: matsuoka@cs.utexas.edu class website: http://www.cs.utexas.edu/~matsuoka/cs380d |
||||
| Class |
MW 3:30-5:00P in UTC 3.124 (was RAS 215) |
||||
| Make-Up Classes | Make-up classes to be announced | ||||
| Discussion Sections |
M 12:30-1:30PM TAY 3.144 W 2:30-3:30PM TAY 3.144 |
||||
| Subject Matter |
The goal of this course is to present a number of important
ideas in distributed computing and provide rigorous methods for
reasoning about distributed programs. The topics are: distributed
detection algorithms; distributed resource allocation; logical
clocks; global snapshot; a logic for reasoning about distributed
programs; safety and progress; Byzantine agreement; and transaction
processiong. Other subjects may be covered as time allows. |
||||
| Reading Material |
|
||||
| Tests |
Two in-class tests will be given, on Oct 6th and Nov 12th.
A third test will be given during finals week, on Dec 12th, at 7pm.
All tests are open book and open notes. Your best test counts for 50% of the
grade, the next best for 40%, and the worst one for 10%. Homeworks
will be given; they will be discussed in the class and in the
discussion sections, but they will not be graded. The tests will be
modeled after the homeworks.
|
||||
| Student Code of Conduct |
Please be familiar with
the student
code of conduct. |