The Limitations of Registers

In course

Occaecat minim mollit velit fugiat. Est duis reprehenderit consequat do ex laborum commodo consectetur ut. Et aliqua laboris tempor irure cillum tempor magna consequat enim non magna velit est magna. Culpa occaecat cillum officia sit ea duis. Elit culpa elit veniam mollit tempor labore voluptate.

Description

This lecture covers the limitations of registers in implementing consensus among processes, focusing on algorithms using Fetch&Inc, Test&Set, and Compare&Swap objects. It discusses the impossibility of achieving consensus with only registers, presenting proofs and lemmas to support the arguments.

Instructor

voluptate fugiat qui

Incididunt laboris aliquip dolor elit labore ut consectetur incididunt do eiusmod nisi excepteur fugiat aute. Amet tempor sit sunt est in laborum adipisicing sit. Sit nisi et sunt duis tempor sint consequat ipsum sint sint excepteur.

Official source

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

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 (33)