Operating System: Banker's Deadlock Avoidance Algorithm (Hardcoded) Implementation in Python (Using Numpy aka Numerical Python)
-
Updated
May 7, 2022 - Python
Operating System: Banker's Deadlock Avoidance Algorithm (Hardcoded) Implementation in Python (Using Numpy aka Numerical Python)
This Python repository solves the Dining Philosophers problem using threading and synchronization. It ensures smooth resource sharing among philosophers, preventing conflicts like deadlock. The implementation manages philosopher states efficiently, balancing thinking, hunger, and eating without issues.
Simulador do algoritmo do banqueiro (estado seguro, algoritmo de requisição e detecção de deadlock) para prevenção de impasses.
Sokoban Solver developed in the Artificial Intelligence course, IA UA 2020/2021
Add a description, image, and links to the deadlock-avoidance topic page so that developers can more easily learn about it.
To associate your repository with the deadlock-avoidance topic, visit your repo's landing page and select "manage topics."