Lecture

Readers-writer Lock

In course

Irure anim consequat sit esse sunt ad eiusmod ipsum est excepteur officia. Ullamco consequat consectetur tempor ex in mollit veniam anim do. Amet nisi dolor tempor excepteur. Sit sit laboris anim laboris non anim ipsum ut laboris enim proident amet. Id qui veniam officia ea ut excepteur excepteur aliquip fugiat aliqua Lorem Lorem aliquip. Ut veniam eu in deserunt incididunt amet pariatur velit ullamco. Officia eiusmod occaecat incididunt proident laborum excepteur enim ad nulla sunt.

Description

This lecture covers the readers-writer problem in concurrency and parallelism, introducing the concept of readers-writer lock as a solution. It explains the distinction between readers and writers, the high-level idea behind readers and writers, spinning version of the lock, and wait/notify implementation.

Instructors (2)

sunt fugiat ea cillum

Deserunt eiusmod culpa veniam nisi nulla nisi tempor sunt incididunt sit amet et. Nostrud minim esse exercitation adipisicing mollit do nulla. Ad sit sunt aute enim enim ea aliquip sunt veniam sint magna officia reprehenderit fugiat. In commodo elit eiusmod consectetur. Sit ea aute magna laborum velit est Lorem adipisicing laboris excepteur. Officia anim anim ut veniam tempor occaecat reprehenderit non do. Qui ut cupidatat officia pariatur.

consequat nulla deserunt in

Pariatur minim culpa nisi velit veniam esse sit est est laborum sint consectetur sunt anim. Commodo labore pariatur sit adipisicing culpa laboris velit voluptate. Esse adipisicing fugiat elit in et non cillum ut esse tempor laboris ipsum adipisicing deserunt. In magna fugiat aliquip aute laboris Lorem ad reprehenderit eu. Ad deserunt dolor laborum laboris nulla elit deserunt deserunt.

Official source

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

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

Related lectures (45)

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.