Skip to content
Implementation of the Multilevel Feedback Queue and Priority algorithms in the Minix3 Schedulers.
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
MFQ
Priority
README.md
Report.pdf
performance.c

README.md

Implementing Schedulers in Minix3

** Akshita Mittel

The main aim of this assignment is to understand the current Minix kernel and its scheduling algorithms. Based on the knowledge alter the current schedulers to implement our own algorithms, and test their performance in different situations. The two algorithms implemented are the Multi-level Feedback Queue and priority.

The performance test code is present in this directory.

The MFQ, and Priority are present in their directories along with their ReadMe.

The testing procedures are also mentioned in the directories itself.

You can’t perform that action at this time.