Pop Quiz #5: MLFQ: FA21: CS-149 Sec 02 - Operating Systems

pdf

School

University of Southern California *

*We aren’t endorsed by this school

Course

317

Subject

Computer Science

Date

Feb 20, 2024

Type

pdf

Pages

3

Uploaded by CountSwan3693

Report
9/14/21, 8 : 47 PM Pop Quiz #5: MLFQ: FA21: CS-149 Sec 02 - Operating Systems Page 1 of 3 https://sjsu.instructure.com/courses/1433630/quizzes/1525803 Pop Quiz #5: MLFQ Due Sep 14 at 11:59pm Points 6 Questions 1 Available after Sep 7 at 4pm Time Limit None Allowed Attempts 4 Attempt History Attempt Time Score KEPT Attempt 3 less than 1 minute 6 out of 6 LATEST Attempt 3 less than 1 minute 6 out of 6 Attempt 2 2 minutes 4.5 out of 6 Attempt 1 less than 1 minute 4.5 out of 6 ! Correct answers are hidden. Score for this attempt: 6 out of 6 Submitted Sep 9 at 7:20pm This attempt took less than 1 minute. Take the Quiz Again 6 / 6 pts Question 1
9/14/21, 8 : 47 PM Pop Quiz #5: MLFQ: FA21: CS-149 Sec 02 - Operating Systems Page 2 of 3 https://sjsu.instructure.com/courses/1433630/quizzes/1525803 Recall the refined set of MLFQ rules that are listed below Rule 1: If Priority(A) > Priority(B), A runs (B doesn’t). Rule 2: If Priority(A) = Priority(B), A & B run in RR. Rule 3: When a job enters the system, it is placed at the highest priority. Rule 4: Once a job uses up its time allotment at a given level (regardless of how many times it has given up the CPU), its priority is reduced(i.e., it moves down on queue). Rule 5: After some time period S, move all the jobs in the system to the topmost queue. Choose the true statement(s) about the multilevel feedback queue scheduling.
9/14/21, 8 : 47 PM Pop Quiz #5: MLFQ: FA21: CS-149 Sec 02 - Operating Systems Page 3 of 3 https://sjsu.instructure.com/courses/1433630/quizzes/1525803 Unlike SJF, there is no need for the estimation of the CPU service time per process. Like SJF, it relies on the accurate prediction of the next CPU bursts. Like SJF, short-time jobs have higher priority than long-time jobs, but both kinds of jobs have better response time than SJF. It is a combination of priority scheduling and round-robin scheduling with different quantum If all jobs have very large CPU burst, then MLFQ will work like RR with better response time than FCFS It has better response time for large jobs than SJF If all jobs have very short CPU burst (< 8 time units), then MLFQ will behave like pure FCFS scheduling For MLFQ without Rule 5, the starvation is a possible problem. The short interactive jobs tend to have shorter waiting time than batch jobs. Quiz Score: 6 out of 6
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help