CS 598 CAL - Consensus Algorithms
Last offered Spring 2022
Subject offerings of new and developing areas of knowledge in computer science intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites. Course Information: May be repeated in the same or separate terms if topics vary.
This course covers classic results and recent advances in consensus algorithms. The course studies different problem formulations including Byzantine agreement, broadcast primitives and state machine replication, different models and assumptions regarding timing, fault pattern, cryptography and setup, state-of-art algorithms and lower bounds under various combinations of these settings, common algorithm design techniques including randomization, leader election and quorum systems, Nakamoto?s new paradigm of permissionless consensus including the Bitcoin protocol, improvement proposals, alternative designs, and connections to the permissioned setting.
|Consensus Algorithms||CAL||40099||S3||4||1230 - 1345||W F||1109 Siebel Center for Comp Sci||Ling Ren|