Skip to content

Latest commit

 

History

History
16 lines (11 loc) · 678 Bytes

README.md

File metadata and controls

16 lines (11 loc) · 678 Bytes

critical-sections

This project implements a solution to the classic Dining Philosophers Problem using multithreading in C++. The solution utilizes Windows API for thread management and synchronization.

Features

  • Multithreaded implementation simulating philosophers dining.
  • Utilizes critical sections for synchronization to prevent deadlock.
  • Measures execution time of the dining process.

Requirements

  • Windows Operating System
  • Visual Studio (or any compatible C++ compiler)

Alt Text