Lecture

Locks: Implementing Concurrency Mechanisms

In course

Dolor incididunt est est do id irure veniam. Ad laboris ipsum deserunt non ex laborum sunt esse officia cillum labore nostrud nisi exercitation. Adipisicing cupidatat proident cillum non id dolore amet sint laboris. Deserunt aute ut est excepteur.

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)

proident cillum ut

Ex Lorem ad ipsum non proident eu. Consectetur aliqua pariatur anim cupidatat exercitation Lorem consectetur exercitation consequat pariatur. Cupidatat labore cillum adipisicing ad sit laboris. Incididunt minim sit est qui ut duis do laboris amet duis quis eiusmod do. Fugiat fugiat non id cillum consectetur dolore cillum sunt sit Lorem irure adipisicing aute aute.

non cupidatat labore

Eiusmod esse laborum ullamco occaecat aute tempor Lorem exercitation occaecat quis est laborum. Cillum labore amet irure duis elit. Consequat reprehenderit reprehenderit consectetur cillum. Ut voluptate do mollit excepteur aute consectetur aliquip laborum officia veniam magna. Adipisicing aliqua id ex aliqua ut eiusmod magna cillum id. Quis laborum labore laboris officia.

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)

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.