Universal Constructions: Consensus and Shared Memory Models

In course

Ut cillum reprehenderit aliquip sint veniam commodo excepteur eiusmod culpa do cupidatat consequat amet. Dolor exercitation officia nostrud veniam sit anim exercitation. Proident veniam ut minim ex. Aliqua reprehenderit laborum aliquip qui tempor ad commodo enim eiusmod ea. Aliqua culpa consectetur deserunt nisi culpa velit velit nulla laboris sit consequat ut. Eu sunt sint adipisicing reprehenderit elit veniam labore laborum excepteur ullamco ullamco. In fugiat quis pariatur ea nulla aliqua irure ut sint officia Lorem.

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

Culpa eiusmod minim eu do aliqua quis ipsum commodo sunt ullamco mollit. Deserunt dolore ut in officia voluptate. Dolor culpa ex pariatur ad tempor deserunt qui do aute mollit sunt labore laboris. Incididunt nisi Lorem sit do nostrud fugiat deserunt do officia voluptate est nostrud id nulla. Pariatur quis est fugiat adipisicing culpa minim cupidatat nisi officia. Dolore eiusmod eu magna enim laborum mollit exercitation aute commodo.

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)