Operating Systems Course (Sem 5)-Practice Codes
-
Updated
Dec 6, 2020 - C
Operating Systems Course (Sem 5)-Practice Codes
🎿 Примеры параллельного программирования.
Interacting with threads and processes using semaphores and mutex
Then dinning Philosopher problem with mutex
This project is about The dining philosophers problem, where multithreading/multiprocessing and mutexes/semaphores are used to solve the problem.
Philosophers an individual project at 42 about introduction to the basics of process threading, and how work on the same memory space. And learn about mutexes, semaphores, and shared memory.
Dinning savages algorithm example using threads MUTEX
An implementation of the dining philosophers problem and memory management with holes
Operating System Traditional Programs
This is a solution to the dining philosophers problem in C using pthreads and semaphores.
In this project, you will learn the basics of threading a process. You will see how to create threads and you will discover mutexes.
[documented code / -pedantic -std=c89] - 42School variant of the dining philosophers problem to learn the basics of threading a process, how to create threads and use mutexes.
Windows OS concepts in C language
SPPU (INFORMATION TECHNOLOGY CODE)
Add a description, image, and links to the dinning-phillospher topic page so that developers can more easily learn about it.
To associate your repository with the dinning-phillospher topic, visit your repo's landing page and select "manage topics."