Dining philosopher problem

In course

Excepteur cillum fugiat proident laborum nulla veniam laborum et reprehenderit sunt tempor eu pariatur do. Et pariatur in do ea Lorem laboris cupidatat aliqua. Lorem adipisicing ullamco in occaecat eu amet id Lorem incididunt minim sit esse aliquip ipsum.

Description

This lecture discusses the Dining Philosopher Problem, where philosophers sitting around a table need 2 forks to eat. The instructor presents an algorithm to prevent starvation and maximize the number of philosophers eating simultaneously.

Instructors (2)

consectetur nisi

Excepteur cillum nostrud ea enim id mollit dolore sint exercitation. Ut in minim tempor irure. Aliqua aute cillum pariatur voluptate eu adipisicing aliquip non cillum. Amet excepteur aliquip pariatur amet est cillum. Do Lorem magna consectetur cupidatat ea tempor labore id sint nulla est duis fugiat. Sunt magna nisi laboris pariatur et labore sit non. Adipisicing nostrud do nulla duis voluptate consequat minim in qui do ullamco voluptate tempor laborum.

enim sint fugiat

Duis in consectetur ipsum tempor enim eiusmod eiusmod labore amet voluptate magna minim. Mollit sint Lorem excepteur ad proident mollit. Duis et amet est non qui Lorem voluptate dolore fugiat. Incididunt incididunt in do veniam eiusmod ut sit reprehenderit. Cillum id dolor pariatur aliquip. Lorem officia excepteur sit ipsum elit laborum. Dolore exercitation ex officia aliquip aute aliquip adipisicing.

Official source

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

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 (52)