ECE 526
Fall 2024 All Classes
All Classes
Credit: 4 hours.
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.
Same as CS 539. 4 graduate hours. No professional credit. Prerequisite: One of CS 473, ECE 428, ECE 438.
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
63200
|
Lecture
|
A
|
11:00AM
-12:15PM
|
MW
|
0222 Siebel Center for Comp Sci
|
Ren, L
|
|