|
| |
|
CS 6380
Distributed Computing
|
|
COURSE DESCRIPTION |
|
Topics include distributed algorithms, election algorithms,
synchronizers, mutual exclusion, resource allocation, deadlocks, Byzantine
agreement and clock synchronization, knowledge and common knowledge,
reliability in distributed networks, proving distributed programs correct.
|
|
COURSE LEARNING OBJECTIVES |
|
To give the student ideas and insights on numerous system
level problems encountered in distributed systems and techniques for solving
them.
|
|
MAJOR
TOPICS |
|
Introduction; Synchronous Network Algorithm (Modeling I:
Synchronous Network Model, Leader Election in a Synchronous Ring, Algorithms
in General Synchronous Networks, Distributed Consensus with Link Failures,
Distributed Consensus with Process Failures); Asynchronous Network Algorithms
(Modeling IV: Asynchronous Network Model, Basic Asynchronous Network
Algorithms, Synchronizers, Shared Memory versus Networks, Logical Time, Global
Snapshots and Stable Properties, Network Resource Allocation, Asynchronous
Networks with Process Failures, Data Link Protocols).
|
| |
|
