Describe what an operating system uses Process Control Block for and why? Explain 4 reasons why a process is created in a computer system Explain 3 reasons why a process may be terminated from a computer system Distinguish between short-term scheduling and long-term scheduling of the processor. Suppose 5 processes A, B, C, D and E arrive at the times indicated, and each of them is executed for the amount of time specified in the table below:                      Process          Arrival Time             Service Time (Ts)                                                  A                              0                                         4                                B                             2                                              3                   C                             5                                              6                  D                             8                                              4                  E                              9                                              2      Using Shortest Process Next (SPN) scheduling algorithm, determine the following:                       (i).   the finish time for each process.                     (ii).  the turnaround time for each process.                       (iii). the normalized turnaround time for each process.                 (iv). the mean turnaround time for all processes.                              (v).  the mean normalized turnaround time for all processes.

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
icon
Related questions
Question
  1. Describe what an operating system uses Process Control Block for and why?
  2. Explain 4 reasons why a process is created in a computer system
  3. Explain 3 reasons why a process may be terminated from a computer system
  4. Distinguish between short-term scheduling and long-term scheduling of the processor.
  5. Suppose 5 processes A, B, C, D and E arrive at the times indicated, and each of them is executed for the amount of time specified in the table below:   

                  Process          Arrival Time             Service Time (Ts)                                

                 A                              0                                         4             

                  B                             2                                              3

                  C                             5                                              6

                 D                             8                                              4

                 E                              9                                              2

 

   Using Shortest Process Next (SPN) scheduling algorithm, determine the following:      

                (i).   the finish time for each process.    

                (ii).  the turnaround time for each process.      

                (iii). the normalized turnaround time for each process.

                (iv). the mean turnaround time for all processes.             

                (v).  the mean normalized turnaround time for all processes.

 

 

Expert Solution
steps

Step by step

Solved in 4 steps with 4 images

Blurred answer
Knowledge Booster
Analysis of Performance Measurement
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.
Similar questions
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