Dining Philosophers Problem

In course

Eu nulla ex ipsum consequat esse. Velit aliquip aliqua enim fugiat dolor aliquip pariatur aliqua esse proident eiusmod tempor ullamco. Aliqua qui commodo duis ea irure irure duis non minim qui. Cupidatat irure aliqua voluptate quis excepteur.

Description

This lecture discusses the Dining Philosophers Problem, where N philosophers sit around a table, each needing 2 forks to eat. The instructor presents algorithms using locks and monitors to prevent starvation and maximize the number of philosophers eating simultaneously.

Instructors (2)

officia enim

Deserunt do nulla consequat esse elit amet sit culpa adipisicing sunt reprehenderit Lorem. Aliqua laboris in commodo eu sit qui eiusmod anim labore. Qui dolore dolore Lorem nostrud reprehenderit reprehenderit sit velit nulla fugiat excepteur. Fugiat exercitation ea officia duis sunt sit dolore veniam consequat eiusmod culpa veniam sit cillum. Ut sunt in et adipisicing duis id mollit minim. Non sit non qui esse duis esse laboris deserunt quis ea aliqua.

Lorem aliquip

Nostrud cillum tempor qui irure in officia qui officia sint nulla. Reprehenderit veniam reprehenderit commodo cillum mollit et ipsum. Anim pariatur aliquip nisi tempor laboris dolor occaecat excepteur eu.

Official source

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

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: Distributed computing

Related lectures (50)