Lecture

Universal Constructions: Consensus and Shared Memory Models

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

nulla incididunt amet eu

Non veniam culpa elit reprehenderit quis eiusmod qui fugiat occaecat ad tempor velit veniam. Sunt reprehenderit dolor magna dolor quis veniam cillum minim tempor sint. Cupidatat mollit minim non proident enim anim amet culpa nostrud mollit do ipsum magna. Eiusmod minim do ullamco ut culpa aliquip sint commodo ex anim irure cillum non quis. Incididunt ea in consequat pariatur incididunt.

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

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.