PLEASE DO THE CODING PORTION OF THIS ASSIGNMENT

Module 8 CPU scheduler Code and Report

Project objective: To learn more about OS CPU scheduling through a hands-on simulation programming experience. To simulate, compare, and evaluate CPU scheduling algorithms using a consistent set of data. Directions The following information should be included in your document, numbered and in order: Name: Date: Language used: 1. Introduction 2. Insert one table (See the DETAILS document for example ) that includes the entire simulation results for CPU Utilization, Response Time (RT) , Waiting Time (WT), Turnaround Time (TT) PER PROCESS and Averages for both FCFS(648 time units) and SJF (668 time units) 3. Discussion of the results:

a. Which algorithm (FCFS or SJF) has the best CPU utilization ? b. Which algorithm (FCFS or SJF) has the worst CPU utilization ? c. How many context switches are in the simulation of FCFS ? d. How many context switches are in the simulation of SJF ? e. How does the number of context switches effect the performance of the algorithm? f. Which algorithm (FCFS or SJF) has the lowest average waiting time. g. Which algorithm (FCFS or SJF) has the lowest average response time. h. Which algorithm (FCFS or SJF) has the lowest average turnaround time. i. How well did the results match your prediction?

4. Insert a sample of the Program Output that includes the first 50 time units and the last 50 time units, and the calculated results. 5. Insert a partial or complete Gantt chart for FCFS. (NOTE: IF YOU DID NOT GET YOUR CODE TO WORK CORRECTLY,YOU MUST COMPLETE AND SUBMIT A FULL GANTT CHART IN THIS REPORT DO NOT INSERT MY GANTT CHART, CREATE YOUR OWN) 6. Provide clear instructions on how to compile, build, and run the simulator (this will indicate that the application has been tested and works on the engineering student desktop)