Hi, this is a CPU Scheduler Assignment, if you could just answer these two quest

Question

Hi, this is a CPU Scheduler Assignment, if you could just answer these two questions and the directions are in the image below. Thank you!

1. Language that will be used

2. Implementation plan discussion

Algorithms and data: FCFS non preemptive 2. MLFQ Multilevel Feedback Queue (preemptive Queue 1 uses RR scheduling with Tq-5 Queue 2 uses RR scheduling with Tq-15 Queue 3 uses FCFS absolute priority in higher queues) 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. Al 2. Assume that 3. After completing an IO event, a process is transferred to the ready queue 4. Waiting time is accumulated while a process 5. Turnaround time is a total of (Waiting time) (CPU burst time) (O time) 6. Response time is the first measure of waiting time from arrival at time 0 until the first time Il processes are activated at time 0 t no process waits on IO devices. waits in the ready queue. on the CPU Process Data: process goes CPU burst, IO time, CPU burst, L/O time, CPU burst, LO time,...., ast CPU burst) P1 5, 27, 3, 31, 5, 43, 4, 18, 6, 22, 4, 26, 3, 24, 4) P2 4, 48, 5, 44, 7, 42, 12, 37, 9, 76, 4, 41, 9, 31, 7, 43, 8) P3 8, 33, 12, 41, 18, 65, 14, 21, 4, 61, 15, 18, 14, 26, 5, 31, 6) P4 3, 35, 4, 41, 5, 45, 3, 51, 4, 61, 5, 54, 6, 82, 5, 77, 3) P5 16, 24, 17, 21, 5, 36, 16, 26, 7, 31, 13, 28, 11, 21, 6, 13, 3, 11, 4) P6 11, 22, 4, 8, 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, 14, 5, 33, 6, 51, 14, 73, 16, 87, 6)

Explanation / Answer

what language used:operating system

a multilevel feedback queue is a scheduling algorithm. Solaris 2.6 Time-Sharing (TS) scheduler implements this algorithm. The MacOS and Microsoft Windows schedulers can both be regarded as examples of the broader class of multilevel feedback queue schedulers.This scheduling algorithm is intended to meet the following design requirements for multimode systems:

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.