Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
The Limitations of Registers
In course
DEMO: adipisicing sit
Sint dolor reprehenderit qui enim incididunt. Elit quis do consequat ea laboris ipsum irure ipsum cupidatat excepteur irure labore laborum. Adipisicing dolor voluptate labore velit ut.
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
cupidatat anim adipisicing enim
Laboris minim voluptate dolore nisi ea quis laborum elit do adipisicing consectetur incididunt in cillum. Elit dolore sit ut voluptate tempor ad quis deserunt in ea duis officia dolor. Officia nisi est enim quis incididunt aute.
Official source
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)
Quasi-newton optimization
Covers gradient line search methods and optimization techniques with an emphasis on Wolfe conditions and positive definiteness.
Algorithms & Growth of Functions
Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.
Recursive Algorithms: Induction & Sorting
Explores induction, recursion, and sorting algorithms, including merge sort and the proof of correctness for recursive algorithms.
Optimization Algorithms: Greedy Approach
Explores optimization problems and greedy algorithms for efficient decision-making.
Proofs and Logic: Introduction
Introduces logic, proofs, sets, functions, and algorithms in mathematics and computer science.