ECE 526
ECE 526 - Distributed Algorithms
Fall 2024
| Title | Rubric | Section | CRN | Type | Hours | Times | Days | Location | Instructor |
|---|---|---|---|---|---|---|---|---|---|
| Distributed Algorithms | CS539 | A | 79840 | LEC | 4 | 1100 - 1215 | M W | 0222 Siebel Center for Comp Sci | Ling Ren |
| Distributed Algorithms | ECE526 | A | 63200 | LEC | 4 | 1100 - 1215 | M W | 0222 Siebel Center for Comp Sci | Ling Ren |
See full schedule from Course Explorer
Official Description
Theoretical aspects of distributed algorithms, with an emphasis on formal proofs of correctness and theoretical performance analysis. Algorithms for consensus, clock synchronization, mutual exclusion, debugging of parallel programs, peer-to-peer networks, and distributed function computation; fault-tolerant distributed algorithms; distributed algorithms for wireless networks. Course Information: Same as CS 539. 4 graduate hours. No professional credit. Prerequisite: One of CS 473, ECE 428, ECE 438.
Subject Area
- Computer Engineering
Course Director
Last updated
5/28/2014