ECE 526
Spring 2013 Part of Term 1
Part of Term 1
Jan 14-May 1
Jan 14-May 1
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.
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
58837
|
Lecture
|
A
|
9:30AM
-10:50AM
|
TR
|
1131 Siebel Center for Comp Sci
|
Vaidya, N
|
|