Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Draw three timelines that illustrate the execution of these processes using i. shortest job first, SJF ii. nonpreemptive priority, NPP - a smaller number has a higher priority

Draw three timelines that illustrate the execution of these processes using i. shortest job first, SJF ii. nonpreemptive priority, NPP - a smaller number has a higher priority

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

Process Scheduling in Operating System. All of the information is below

Consider the following arrivals of processes in an interactive system. (a) Draw three timelines that illustrate the execution of these processes using i. shortest job first, SJF ii. nonpreemptive priority, NPP — a smaller number has a higher priority iii. round-robin, RR, with time slice 2.
Transcribed Image Text:Consider the following arrivals of processes in an interactive system. (a) Draw three timelines that illustrate the execution of these processes using i. shortest job first, SJF ii. nonpreemptive priority, NPP — a smaller number has a higher priority iii. round-robin, RR, with time slice 2.
process arrival time CPU time P₁₂ P2 P3 PA P5 P6 0 0 3 4 8 8 3 3 4 2 3 1 priority 2 1 2 3 1 2 If there is a tie (same CPU time for SJF or same priority for NPP), use first-in-first-out (FIFO) to break the tie. For RR scheduling, if P₁ is removed from the CPU and put in the waiting queue just when P3 arrives, P3 will be ahead of P₁ in the queue. (b) What is the average waiting time for RR?
Transcribed Image Text:process arrival time CPU time P₁₂ P2 P3 PA P5 P6 0 0 3 4 8 8 3 3 4 2 3 1 priority 2 1 2 3 1 2 If there is a tie (same CPU time for SJF or same priority for NPP), use first-in-first-out (FIFO) to break the tie. For RR scheduling, if P₁ is removed from the CPU and put in the waiting queue just when P3 arrives, P3 will be ahead of P₁ in the queue. (b) What is the average waiting time for RR?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Types of Database Architectures
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS