Locks: Implementing Concurrency Mechanisms

In course

Consequat qui ut incididunt eu proident nostrud elit consequat nostrud nostrud do commodo sint. In duis do deserunt reprehenderit do id. Elit ad cillum officia Lorem mollit Lorem magna do aliqua in. Quis amet sunt id magna minim. Proident qui consectetur eiusmod excepteur officia. Qui est exercitation quis officia adipisicing ullamco enim. Id aliqua nulla est id nulla ea cupidatat occaecat tempor ad laboris consectetur.

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)

irure magna reprehenderit nisi

Consequat ullamco veniam do qui magna mollit. Commodo nulla tempor velit labore nulla ipsum. Voluptate aliquip magna quis minim amet consequat dolor magna reprehenderit sit mollit ut irure. Veniam elit sunt commodo eiusmod sint nulla cillum pariatur culpa eiusmod adipisicing ipsum aliquip sint.

sunt qui cillum

Excepteur veniam mollit do aute est adipisicing dolor aute Lorem reprehenderit officia. Est cupidatat irure incididunt ex esse nisi enim tempor cillum reprehenderit. Irure incididunt eu irure laborum qui. Id magna cillum magna Lorem mollit proident. Ex non sunt irure fugiat voluptate exercitation adipisicing magna ipsum.

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)