Answer Happy

1. Code execution Instructions. Provide clear and detailed instructions on how to compile the code, build and run the simulator application (this will indicate that the application has been tested and works on the engineering student desktop or an online IDE) 2. Introduction Introduce the assignment and the SJF algorithm. Discuss your expectations for how SJF results will compare with the FCFS results provided. Describe how well your predicted SJF results compared to the FCFS results provided after the SJF simulation was completed

Algorithms and data : a 1. SJF non preemptive (partial results provided) 2. MLFQ (partial results provided) Multilevel Feedback Queue (preemptive - absolute priority in higher queues) Queue I uses RR scheduling with Tq - 8 Queue 2 uses RR scheduling with Tq - 12 Queue 3 uses FCFS All processes enter first queue 1. If time quantum (Tq) expires before CPU burst is complete, the process is downgraded to next lower priority queue. Processes are not downgraded when preempted by a higher queue level process. Once a process has been downgraded, it will not be upgraded. ***DO NOT SUBMIT FCFS implementation - use my FCFS results for the report comparison *** 3. FCFS - non preemptive results provided for comparison) – add the results to your tables along with your own results for SJF and MLFQ Assumptions: 1. All processes are activated at time 0 2. Assume that no process waits on 10 devices. 3. After completing an I/O event, a process is transferred to the ready queue. 4. Waiting time is accumulated while a process waits in the ready queue. 5. Turnaround time is a total of (Waiting time) + (CPU burst time) + (1/O time) 6. Response time is the first measure of waiting time from arrival at time until the first time on the CPU Process Data: process goes (CPU burst, 10 time, CPU burst, 10 time, CPU burst, 10 time...... last CPU burst P1 ( 7, 22, 6, 19, 12, 44, 8, 21, 18, 37, 5, 24, 6, 44, 7, 43, 8) P2 ( 14, 48, 15, 44, 17, 42, 22, 37, 19, 76, 14, 41, 16, 31, 17, 43, 18) P3 { 8, 43, 7, 41, 6, 45, 8, 21, 9, 35, 14, 18, 5, 26, 3, 31, 6} P4 ( 13, 37, 4, 41, 5, 35, 12, 41, 8, 55, 15, 34, 6, 73, 5, 77, 3} P5 ( 6, 34, 7, 21, 5, 44, 6, 32, 7, 28, 3, 48, 11, 44, 6, 33, 3, 28, 4) P6 ( 9, 32, 4, 28, 5, 10, 6, 12, 7, 14, 9, 18, 12, 24, 15, 30, 8) P7 ( 14, 46, 17, 41, 11, 42, 15, 21, 4, 32, 7, 19, 16, 33, 10) P8 ( 4, 64, 5, 53, 6, 44, 4, 73, 6, 87, 5 ,66, 8, 25, 6, 33, 9, 41, 7} P9 ( 13, 37, 8, 41, 7, 27, 12, 29, S, 27, 6, 18, 3, 33, 4, 62, 6}