Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
2. a) Your colleague has invented a new scheduling algorithm using the multilevel queue approach. This list of processes showing CPU burst times is below. There are three queues used in the application. The processes all start on the first queue and receive upto 10ms of burst time. Once the process has received the 10ms on the first queue, if the process still requires burst time it is passed to the second queue where it receives upto 20ms. Once the process has received the 20ms on the second queue, if the process still requires burst time it is passed to the third queue where it receives CPU time until it is completed. The operating system will only start allocating CPU time to processes on the second queue when queue 1 is empty. The operating system will only start allocating CPU time to processes on the third queue when queue 2 is empty. Process Number P1 P2 P3 P4 Burst time (ms) 21 8 35 50 i) Does this algorithm give higher priority to any queue over the others and any processes over the others?

2. a) Your colleague has invented a new scheduling algorithm using the multilevel queue approach. This list of processes showing CPU burst times is below. There are three queues used in the application. The processes all start on the first queue and receive upto 10ms of burst time. Once the process has received the 10ms on the first queue, if the process still requires burst time it is passed to the second queue where it receives upto 20ms. Once the process has received the 20ms on the second queue, if the process still requires burst time it is passed to the third queue where it receives CPU time until it is completed. The operating system will only start allocating CPU time to processes on the second queue when queue 1 is empty. The operating system will only start allocating CPU time to processes on the third queue when queue 2 is empty. Process Number P1 P2 P3 P4 Burst time (ms) 21 8 35 50 i) Does this algorithm give higher priority to any queue over the others and any processes over the others?

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
2. a) Your colleague has invented a new scheduling algorithm using the multilevel queue approach. This list of processes showing CPU burst times is below. There are three queues used in the application. The processes all start on the first queue and receive upto 10ms of burst time. Once the process has received the 10ms on the first queue, if the process still requires burst time it is passed to the second queue where it receives upto 20ms. Once the process has received the 20ms on the second queue, if the process still requires burst time it is passed to the third queue where it receives CPU time until it is completed. The operating system will only start allocating CPU time to processes on the second queue when queue 1 is empty. The operating system will only start allocating CPU time to processes on the third queue when queue 2 is empty. Process Number P1 P2 P3 P4 Burst time (ms) 21 8 35 50 i) Does this algorithm give higher priority to any queue over the others and any processes over the others?
Transcribed Image Text:2. a) Your colleague has invented a new scheduling algorithm using the multilevel queue approach. This list of processes showing CPU burst times is below. There are three queues used in the application. The processes all start on the first queue and receive upto 10ms of burst time. Once the process has received the 10ms on the first queue, if the process still requires burst time it is passed to the second queue where it receives upto 20ms. Once the process has received the 20ms on the second queue, if the process still requires burst time it is passed to the third queue where it receives CPU time until it is completed. The operating system will only start allocating CPU time to processes on the second queue when queue 1 is empty. The operating system will only start allocating CPU time to processes on the third queue when queue 2 is empty. Process Number P1 P2 P3 P4 Burst time (ms) 21 8 35 50 i) Does this algorithm give higher priority to any queue over the others and any processes over the others?
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS