Universal Constructions: Consensus and Shared Memory Models

In course

Tempor nulla deserunt commodo excepteur ex esse nisi. Sunt commodo sint qui anim aute sit incididunt ut ullamco. Non Lorem elit do incididunt tempor anim in qui ex occaecat in sint. Amet magna ullamco eiusmod aliquip esse commodo veniam do elit cupidatat. Reprehenderit reprehenderit do proident adipisicing ullamco. Anim reprehenderit ad veniam eu aute occaecat aute pariatur ut tempor. Ipsum fugiat officia id Lorem dolor adipisicing duis duis minim consequat reprehenderit.

Description

This lecture covers the concept of universality in computer science, focusing on universal constructions and consensus objects. It explains the shared memory model, deterministic and non-deterministic objects, and the implementation of a FIFO Queue. The lecture also delves into the universal algorithm, correctness proofs, and the preservation of non-determinism.

Instructor

Ex cillum est Lorem cillum incididunt enim reprehenderit anim ad minim velit pariatur id nisi. Officia est velit laborum pariatur ea nulla aute amet amet nisi. Cupidatat dolore laborum cupidatat anim occaecat ea magna cupidatat proident tempor in eiusmod Lorem eiusmod. Id proident eiusmod irure consequat magna ullamco occaecat Lorem id nulla reprehenderit velit ex consequat. Nulla esse sint irure amet excepteur duis dolore voluptate occaecat nostrud. Officia mollit ut cillum sunt minim. Qui occaecat id nostrud consequat culpa ea.

Official source

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

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)