https://github.com/abaksy/os_algos
Algorithms implemented in Operating Systems course at PES University, B'lore
https://github.com/abaksy/os_algos
deadlock os-course scheduling
Last synced: 12 months ago
JSON representation
Algorithms implemented in Operating Systems course at PES University, B'lore
- Host: GitHub
- URL: https://github.com/abaksy/os_algos
- Owner: abaksy
- Created: 2020-09-16T14:22:07.000Z (almost 6 years ago)
- Default Branch: master
- Last Pushed: 2024-12-20T19:47:00.000Z (over 1 year ago)
- Last Synced: 2025-03-09T17:41:51.997Z (over 1 year ago)
- Topics: deadlock, os-course, scheduling
- Language: C
- Homepage:
- Size: 23.4 KB
- Stars: 0
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Operating Systems Algorithms
C/C++ implementation of some algorithms used in Operating Systems. This repository covers algorithms from the Dinosaur Book (OS Concepts by Silberschatz, Galvin, Gagne et. al.)
## Scheduling
The output is a table with rows in the order in which the processes in the queue will be submitted to the CPU.
1) Shortest Job First scheduling:
The job with the shortest burst time is sent in first
2) Round Robin Scheduling:
All jobs get an equal slice (quantum) of CPU time, and this repeats until all jobs are complete.
3) Priority Scheduling:
Jobs are submitted to the CPU in order of their user-defined priorities.
## Deadlocks
Deadlock detection algorithm is implemented as presented in the textbook Operating Systems Concepts (9e.) by Galvin, Silberschatz and
Gagne.