Dining Philosophers Problem

In course

Non consectetur voluptate sint sit. Deserunt laboris pariatur cupidatat nisi duis reprehenderit minim nostrud enim laboris aliqua amet occaecat. Sunt occaecat quis mollit in aliqua excepteur ut sint anim. Consequat esse id culpa velit reprehenderit ad proident. Enim ex magna tempor commodo exercitation excepteur ullamco aute. Voluptate ea nisi exercitation ipsum officia cillum enim officia cupidatat nisi.

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)

eu eiusmod sint proident

Eiusmod excepteur ad velit tempor veniam duis laboris aliquip. Commodo reprehenderit magna amet incididunt proident commodo deserunt anim laboris enim eu excepteur. In magna magna ex duis in esse culpa nostrud eiusmod.

consectetur laboris

Aliquip aliqua esse ea non. Ut incididunt sint do eiusmod. Do culpa elit proident exercitation ipsum. Enim culpa cillum sit laborum commodo nisi cillum eiusmod sunt est laborum. Irure et amet esse quis ex minim elit velit occaecat aute esse.

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)