Hello can anyone here help create the partial gantt charts for me based off the data provided from this photo? I posted the requirements which are below and under that I will post the chart with the data. If the photo appears slightly small please open the image in a separate tab. Thank you.

I added the section speaking of algorithms and data. Please let me know if you need anything else.

REQUIREMENTS BELOW

----------------------------------------------------------

Partial Gantt chart for FCFS, AT LEAST 300 TIME UNITS. (non-preemptive) PROGRAM FLOW LOGIC FOR FCFS to demonstrate that the learner understands the algorithm Partial Gantt chart for MLFQ (pre-emptive), AT LEAST 300 TIME UNITS PROGRAM FLOW LOGIC FOR MLFQ to demonstrate that the learner understands the algorithm.

Process Data: process goes {CPU burst, I/O time, CPU burst, I/O time, CPU burst, I/O time,.., last CPU burst}

P1 { 6, 17, 8, 19, 12, 31, 11, 18, 9, 22, 8, 26, 10 } P2 { 19, 38, 11, 24, 15, 21, 12, 27, 12, 34, 11, 34, 9, 29, 9, 31, 7} P3 { 3, 37, 14, 41, 8, 30, 4, 19, 7, 33, 5, 18, 4, 26, 5, 31, 16} P4 { 15, 35, 14, 41, 16, 45, 18, 51, 14, 61, 13, 54, 16, 61, 15} P5 { 9, 24, 7, 21, 15, 31, 6, 26, 7, 31, 3, 18, 6, 21, 6, 33, 3} P6 { 4, 38, 3, 41, 5, 29, 4, 26, 7, 32, 4, 22, 3, 26, 5, 22, 8} P7 { 14, 36, 17, 31, 16, 32, 15, 41, 14, 42, 17, 39, 16, 33, 15} P8 { 5, 14, 4, 33, 6, 31, 4, 31, 6, 27, 5, 21, 4, 19, 6, 11, 6}

1. FCFS non preemptive (partial results provided) 2. MLFQ (partial results provided) Multilevel Feedback Queue (preemptive absolute priority in higher queues) Queue 1 uses RR scheduling with Tq = 6 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. Assumptions: 1. All processes are activated at time 0 2. Assume that no process waits on I/O 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.

PHOTO OF CHART WITH THE DATA

-----------------------------

P2 P1 CPU I/O 17 P3 P3 CPU I I/O 37 14 41 8 30 P6 CPU I/O 38 41 14 P4 P4 P51 P5 CPU |I/O CPU /0 15 35 9 24 24 14 41 21 16 45 15 | 31 18 26 | P8 P8 CPU I/O 14 33 P7 P7 | CPU i/o 36 17 31 16 32 41 19 29 CPU I/O 19 38 11 24 15 21 12 27 12 34 11 34 29 31 12 11 31 31 19 51 4 26 31 18 22 26 15 14 61 31 32 14 42 33 18 26 27 21 13 54 18 17 39 22 26 10 61 21 33 19 16 15 16 15 31 33 5 22 11 5 16