CSE 535 Asynchronous Systems
Spring 2018
Course Description (Syllabus)
With the wide use of networked and embedded systems, today's computing
environment is naturally a distributed system. In the class, we will learn
the basic and advanced algorithms for the distributed systems.
We will also study some real-world examples of distributed systems.
Instructor
YoungMin Kwon (youngmin.kwon at sunykorea dot ac dot kr)
Office: B420
Office hours: TBD
Class hours: MW 2:00pm ~ 3:20pm
Text books and References
- "Distributed Computing, Principles, Algorithms, and Systems", by Ajay D. Kshemkalyani and Mukesh Singhal, Cambridge, 2011, ISBN: 978-0-521-18984-2.
- "Hadoop The Definitive Guide", by Tom White, O'Reilly, 2012, 3rd Ed., ISBN: 978-1-449-31152-0.
- Paxos Made Simple
- Dynamo: Amazon's Highly Available Key-Value Store
- The Google File System
- Spanner: Google's Globally Distributed Database
Final Project
Major Topics Covered in the Class(tentative)
- Logical time and global state
- Coordination and agreement
- Fault tolerance
- Distributed shared memory
Course Learning Outcomes
- Learn basic and advanced distributed algorithms
- Ability to write distributed programs
- Ability to analyze distributed algorithms
Lecture Slides