CSE 6333
Transcript Abbreviation:
Distributed Algs
Course Description:
Fundamental concepts in distributed computing; algorithms for distributed control and data; impossibility and limits; algorithms for fault-tolerance; specification, design and verification of distributed programs.
Course Levels:
Graduate
Designation:
Elective
General Education Course:
(N/A)
Cross-Listings:
(N/A)
Credit Hours (Minimum if “Range”selected):
3.00
Max Credit Hours:
3.00
Select if Repeatable:
Off
Maximum Repeatable Credits:
(N/A)
Total Completions Allowed:
(N/A)
Allow Multiple Enrollments in Term:
No
Course Length:
14 weeks (autumn or spring)
12 weeks (summer only)
Off Campus:
Never
Campus Location:
Columbus
Instruction Modes:
In Person (75-100% campus; 0-24% online)
Prerequisites and Co-requisites:
Prereq: 6431 (760).
Electronically Enforced:
No
Exclusions:
Not open to students with credit for 763.
Course Goals / Objectives:
Master the principles behind several specific classes of distributed algorithms for solving particular problems
Master reading and understanding distributed algorithms
Be familiar with writing and designing distributed programs
Be familiar with the analysis and verification of distributed programs
Check if concurrence sought:
No
Contact Hours:
| Topic | LEC | REC | LAB | LAB Inst |
|---|---|---|---|---|
| Global Time and Order: logical clock, vector clock, causal order and broadcast, clock synchronization algorithms. | 5.0 | 0.0 | 0.0 | 0 |
| Global State and Predicate Detection: consistency, snapshots, termination detection algorithms. | 4.0 | 0.0 | 0.0 | 0 |
| Programming Notation and Logic: syntax and semantics for distributed programs, safety and progress properties, a UNITY-style temporal logic, proofs of program properties, examples, fairness. | 9.0 | 0.0 | 0.0 | 0 |
| Fault-Tolerance: consensus, impossibility of robust consensus, leader election, atomic commitment, Byzantine agreement, Paxos, self-stabilization, distributed reset. | 9.0 | 0.0 | 0.0 | 0 |
| Wait-freedom: atomic register algorithms. | 2.0 | 0.0 | 0.0 | 0 |
| Distributed and Concurrent Data Structures: queues, skip lists, hash sets, linearizability. | 5.0 | 0.0 | 0.0 | 0 |
| Scalability: local, geometric, dense network, small world algorithms. | 4.0 | 0.0 | 0.0 | 0 |
| Total | 38 | 0 | 0 | 0 |
Grading Plan:
Letter Grade
Course Components:
Lecture
Grade Roster Component:
Lecture
Credit by Exam (EM):
No
Grades Breakdown:
| Aspect | Percent |
|---|---|
| Assignments | 35% |
| Midterm | 30% |
| Final | 35% |
Representative Textbooks and Other Course Materials:
| Title | Author | Year |
|---|---|---|
| Elements of Distributed Computing | Vijay K. Garg |
ABET-CAC Criterion 3 Outcomes:
(N/A)
ABET-ETAC Criterion 3 Outcomes:
(N/A)
ABET-EAC Criterion 3 Outcomes:
(N/A)
Embedded Literacies Info:
Attachments:
(N/A)
Additional Notes or Comments:
(N/A)
Basic Course Overview:
CSE_6333_basic.pdf
(10.08 KB)