Built an MLFQ scheduler with four priority queues in C. The top queue (numbered 3) has the highest priority and the bottom queue (numbered 0) has the lowest priority. When a process uses up its time-slice (counted as a number of ticks), it will be downgraded to the lower priority level. The time-slices for higher priorities are shorter than lower priorities. The scheduling method in each of these queues is round-robin, except the bottom queue which is implemented as FIFO.
-
Notifications
You must be signed in to change notification settings - Fork 1
yingxin-jia/Multi-Level-Feedback-Queue-Scheduler
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This is an MLFQ scheduler with four priority queues build with C. The scheduling method in each of these queues is round-robin, except the bottom queue which was implemented as FIFO.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published