Create a Model Round Robin Scheduler
Referencing the Round-Robing scheduling algorithm
In the computer language of your choice, with EXTENSIVE COMMENTS (target 50+% of the working lines are to be commented).
You are given the following:
• It takes 20 time quanta to set-up/create a task process.
• It takes 20 time quanta to tear-down/end a task process.
• It takes 500 time quanta to read in from disk a text file.
• It takes 15 time quanta to context switch.
• It the scheduler takes 30 time quanta at the beginning of each cycle for its own use. In addition, the scheduler also incurs aentry context switch, the same as any other process.
• A high priority user task process is given 90 time quanta of ALU time.
• A standard user task priority process is given 60 time quanta of ALU time.
• When a user task process finishes, it issues a kernel call requesting a tear-down/end process, then it yields its' remaining time quanta and is immediately followed thecontext switch for the teardown process.
• Assume reporters and time quanta counters and their related output report(s) are free, they consume no time quanta.
Contents for the user task process data file (format as you wish):
• User Task A requires 1250 time quanta and has a standard priority
• User Task B requires 970 time quanta and has a high priority
• User Task C requires 75 time quanta and has a standard priority
• User Task D requires 2000 time quanta and has a high priority