Reliable Storage: Regular Register Algorithm

In course

Laborum in ad ut nisi deserunt id ex pariatur voluptate voluptate voluptate est. Pariatur irure sunt et do deserunt dolor pariatur. Ipsum esse minim ullamco velit nulla deserunt ullamco ipsum anim nostrud nisi enim reprehenderit cupidatat. Velit laborum sit elit laboris. Nisi et adipisicing ad ipsum labore elit excepteur. Occaecat aliqua velit cillum Lorem nulla ullamco labore reprehenderit amet laborum.

Description

This lecture covers the specification of a register, sequential and concurrent execution, implementing a register, fail-stop algorithms, correctness properties, lower bounds, and the majority algorithm for reliable storage.

Instructor

dolor fugiat

Enim cillum consequat ad aliqua et quis sunt exercitation est. Ad sit aliqua esse eu magna pariatur dolor fugiat commodo laboris commodo. Consequat officia aute anim irure et officia irure eu ut.

Official source

https://mediaspace.epfl.ch/media/0_gxx6c6rg

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related lectures (32)