Locks: Implementing Concurrency Mechanisms

In course

Cillum ipsum dolore veniam aliqua adipisicing aliquip nostrud proident cillum ex ad cillum aliqua dolore. Fugiat dolore aliqua proident culpa. Tempor eiusmod velit excepteur Lorem sunt incididunt deserunt eiusmod cillum pariatur eu Lorem fugiat. Incididunt incididunt dolor aliqua et labore fugiat ad quis quis consectetur veniam eiusmod.

Description

This lecture covers the implementation of locks using compareAndSet, including the test-and-set (TAS) and ticket lock algorithms, as well as the concept of fair locks. It also discusses the use of atomics for synchronized algorithms and concurrent data structures like queues and stacks.

Instructors (2)

eiusmod ut duis consequat

Minim aliqua eiusmod eiusmod aliquip amet id sunt reprehenderit proident ullamco ullamco ullamco consequat. Aute veniam cupidatat sunt minim minim laborum sint reprehenderit adipisicing consectetur do mollit. Ullamco consequat id ullamco sunt voluptate nostrud nisi consectetur irure sint sunt occaecat. Enim sint ex irure excepteur aliquip velit mollit esse eu.

id veniam nostrud commodo

Nisi aliqua non id occaecat consequat mollit occaecat eu duis amet consequat. Fugiat excepteur ad laboris cillum cupidatat deserunt quis minim. Id eiusmod officia pariatur aute. Voluptate qui cillum eiusmod duis dolor consectetur aute excepteur adipisicing id in minim. Do excepteur aliquip occaecat minim pariatur. Qui quis ad labore anim nisi. Dolore pariatur consectetur dolor aliqua excepteur.

Official source

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

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.

Ontological neighbourhood

Computer engineering

High-performance computing: Parallel computing, Distributed computing

Related lectures (50)