CPU Scheduling Algorithms

this, an interrupt is generated and the state is saved. The CPU then moves to the next process and the same method is followed. Same steps are repeated till all the processes are over. Input file This file is a trace of actual process activity on a real system for 10 processes, contains 2 columns. The first column is the time when a particular process enters the system (arrival time). The second column shows how long the process needs to run on the processor (burst time). Project Report For this project you will be required to write a brief report discussing what you have learned about scheduling policies. You should run the following 7 experimental: - Round-Robin with Quantum equal to zero. - Round-Robin with Quantum equal to 10. - Round-Robin with Quantum equal to 100. - Round-Robin with Quantum equal to 10000. - First-Come, First-Serve. - Shortest Job First Non-Preemptive. - Shortest job First Preemptive. Your report should include such things as why different schedulers perform the way they do, the effects of different length quantum on a Round-Robin scheduler, the effects of preemptive versus non-preemptive scheduling. Additional information about your report: Include the names of each partner on the first page of the report. A softcopy of your report and program should be placed in Blackboard. Your report should be approximately 7-pages long (one page for each experimental). Be brief and concise - not long winded