Credit points: 2.0
Design of algorithms for multi-processor systems, and analysis of their complexity; study of basic problems in such systems; lower bounds and impossibility results.
Specific topics include: Mutual exclusion and resource allocation, agreement problems (Byzantine generals’ problem, approximate agreement, etc.), clock synchronization and logical clocks, broadcast and multicast, lock-free synchronization.
- 2 home assignments 40-50%
- Final assignment 50-60%
- Submission of assignments can be in pairs.