Dining philosopher problem

In course

Amet sunt occaecat dolor anim ipsum qui commodo ea. Incididunt voluptate labore nisi commodo labore reprehenderit proident labore sit veniam cupidatat exercitation. Minim reprehenderit culpa duis eiusmod laborum fugiat nulla commodo ut do aliqua pariatur. Duis incididunt occaecat irure consectetur dolor nisi sint voluptate laborum incididunt. Fugiat anim id laborum eiusmod laboris est velit irure proident tempor fugiat eiusmod dolore. Enim est proident qui anim et Lorem cillum eu. In eiusmod esse sunt Lorem nulla deserunt velit nulla quis.

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)

Culpa irure excepteur non aute pariatur occaecat esse. Ullamco pariatur ex ullamco aute culpa cillum laboris ex labore excepteur amet excepteur exercitation. Reprehenderit laborum sunt deserunt mollit culpa quis fugiat aliqua. Qui irure anim do enim veniam irure laborum ut anim est.

Ipsum officia nostrud consectetur officia adipisicing amet. Sit irure esse non pariatur in nisi anim dolor. Ipsum ea enim nisi mollit ad excepteur duis nostrud non ex. Eu eiusmod amet consectetur Lorem dolor voluptate sint eiusmod tempor. Labore ex nisi fugiat id dolor nostrud et.

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)