Problem Set 6, Part b


Problem set on distributed algorithms, and algorithm that shows how to implement 2-process wait-free consensus using queue objects, determining the consensus number of the stack variable type, Herlihy’s universality construction for wait-free consensus objects, and the safe agreement protocol used in the BG simulation.

Resource Type:

Course Info

Learning Resource Types

assignment Problem Sets
notes Lecture Notes