Draw the Gantt charts that illustrate the execution of these processes using the above scheduling algorithms. ii.What is the turnaround time of each process for each of the scheduling algorithms in part a? iii.What is the waiting time of each process for each of these scheduling algorithms?Which of the algorithms results in the minimum average waiting time (over all processes)? iv.Which of the algorithms results in the minimum average waiting time (over 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. The following processes are being scheduled using a priority (a smaller priority number implies a higher priority) and shortest job first all preemptive scheduling algorithms.

Process         Priority              Burst            Arrival

 P1                   50                      30                  0

P2                    40                    35                    25

P3                    40                    35                    30

P4                    45                    25                    60

P5                    15                    20                    100

P6                    20                    20                    105

 

i.Draw the Gantt charts that illustrate the execution of these processes using the above scheduling algorithms.

ii.What is the turnaround time of each process for each of the scheduling algorithms in part a?

iii.What is the waiting time of each process for each of these scheduling algorithms?Which of the algorithms results in the minimum average waiting time (over all processes)?

iv.Which of the algorithms results in the minimum average waiting time (over all processes)?

 

2.In the four diagrams illustrated below, show which of them result in deadlock? For those situations that will result in deadlock, provide the cycle of resources and threads. For those situations which are not in deadlock, show by illustration the order in which the threads may complete their executions

 

3.Consider a logical address of 128 pages of 1024 words each, mapped onto a physical memory of 64 frames.

    1. How many bits are there in the logical address?
    2. How many bits are there in the physical address?
    3. What is the size of the page table?

4.Direct Memory Access is used for high-speed I/O devices to reduce pressure on CPU’s execution load.

      1. In what way does the CPU interact with the device to coordinate data transfer
      2. In what way does the CPU confirm if the memory operations are complete

 

5.Provide arguments to and against to this assertion. Some computer systems do not offer hardware protection.

 

6.Explain the main advantage of separating mechanism from policy in operating system structures?

T1
T2
T2
T1
R1
R2
R3
R1
R2
R3
00
00
T3
T4
T2
Transcribed Image Text:T1 T2 T2 T1 R1 R2 R3 R1 R2 R3 00 00 T3 T4 T2
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Dynamic Multithreading
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