Computers and Technology, 22.10.2019 19:00 trobbie817

Implement the following 3 cpu scheduling algorithms • simulate and evaluate each with the set of eight processes below. • use any programming language. the program listing should be submitted with the report. 1. fcfs non-preemptive (partial results provided) 2. sjf non-preemptive 3. mlfq multilevel feedback queue (absolute priority in higher queues) queue 1 uses rr scheduling with tq - 5 queue 2 uses rr scheduling with tq - 10 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. 5. turnaround time is a total of (waiting time) + (cpu burst time) + (1/0 time) 6. response time is the first measure of waiting time from arrival at time 0 until the first time on the cpu. process data: process goes cpu burst, i/o time, cpu burst, 10 time, cpu burst, 10 last 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}

Answers: 2

Show answers

Other questions on the subject: Computers and Technology

Computers and Technology, 23.06.2019 02:00, HannahVance99

In the context of an internet connection, llc stands for leased line connection liability limited company local loop complex local loop carrier

Answers: 1

continue

Computers and Technology, 23.06.2019 13:00, torresnoemi899

Which of the following statements is false? a. a class can directly inherit from class object. b. if the class you're inheriting from declares instance variables as private, the inherited class can access those instance variables directly. c. a class's instance variables are normally declared private to enforce good software engineering. d. it's often much more efficient to create a class by inheriting from a similar class than to create the class by writing every line of code the new class requires.

Answers: 3

continue

Computers and Technology, 24.06.2019 11:00, dirttrackr75

Which of the statements below describe the guidelines for the use of text in presentation programs? a. do not use numbered lists. b. fonts should be appropriate for your audience. c. limit the number of fonts you use to three or four. d. only use bulleted lists for sales promotions. e. select font sizes that are appropriate for your delivery method. f. use font colors that work well with your background. select all that apply

Answers: 1

continue

Computers and Technology, 24.06.2019 13:50, Estefaniamarilicolin

What does code do? a creates a text box that says "solid black" b creates a black border of any width c creates a black border 1 pixel wide

Answers: 1

continue

You know the right answer?

Implement the following 3 cpu scheduling algorithms • simulate and evaluate each with the set of eig...