אלגוריתמים מבוזרים

The course deals with the design and analysis of distributed algorithms focusing on issues such as algorithms, models (shared memory and message passing), upper and lower bounds, proof methods, and impossibility results. Possible topics covered include: synchronization and coordination problems such as mutual exclusion; concurrent data structures; decision problems such as consensus, leader election and renaming; distributed graph algorithm such as minimum weight spanning trees; detection algorithms such as deadlock detection and global snapshots. We will also prove that certain problems cannot be solved in an unreliable distributed environment where multiple processes may fail.