A Simple Simulator For The Cfs Scheduler

Posted Under: Operating Systems

Ask A Question
Viewed 21
In this assignment, you are requested to develop a simple simulator for the CFS scheduler. The simulator must implement the following features: 1. to take as input a number of processes along with their priorities, their burst times, and the time they appear in the system. The input can be given as a text file which may have been generated by a separate program or it can be generated on-the-fly with random data if the user enters only the number of processes without the rest of the information. 2. to use a Red-Black tree structure with support for insertion (creation of new processes), deletion (terminated processes), and to update the tree according to the self-balancing rules. 3. to calculate the waiting and response time of each process in the system as well as the corresponding average values. 4. to generate statistics of how many times each process was preempted and how long it stayed in the waiting queue. Use of a library that implements Red-Black trees is not allowed. Make sure your program runs smoothly in a Linux environment and compiles without errors (if C is used, it must compile with gcc).

No uploads for this question

Explanations and Answers 0

No answers posted

Post your Answer - free or at a fee

Login to your tutor account to post an answer

Posting a free answer earns you +20 points.


NB: Post a homework question for free and get answers - free or paid homework help.

Get answers to: A Simple Simulator For The Cfs Scheduler or similar questions only at Tutlance.

Related Questions