Computer Systems: A Programmer's Perspective (3rd Edition)
Computer Systems: A Programmer's Perspective (3rd Edition)
3rd Edition
ISBN: 9780134092997
Author: Bryant
Publisher: PEARSON
bartleby

Concept explainers

Question
Book Icon
Chapter 8, Problem 8.9HW
Program Plan Intro

Given:

ProcessStart timeEnd Time
A57
B24
C36
D18

Expert Solution & Answer
Check Mark

Explanation of Solution

Determine whether the pair of processes run concurrently or not:

Diagram for processes AB:

Computer Systems: A Programmer's Perspective (3rd Edition), Chapter 8, Problem 8.9HW , additional homework tip  1

Explanation:

  • In the above timing diagram, process “A” starts with “5” and end with “7”.
  • Process “B” starts with “2” and end with “4”.
  • Process “A” and “B” are not concurrent with respect to each other because their corresponding executions do not overlap, that is, process “A” completes before process “B” starts.

Therefore, the processes “AB” are do not run concurrently.

Diagram for processes AC:

Computer Systems: A Programmer's Perspective (3rd Edition), Chapter 8, Problem 8.9HW , additional homework tip  2

Explanation:

  • In the above timing diagram, process “A” starts with “5” and end with “7”.
  • Process “C” starts with “3” and end with “6”.
  • Process “A” and “C” are concurrent with respect to each other because their corresponding executions overlap, that is, process “C” starts before the process “A” completes.

Therefore, the processes “AC” are run concurrently.

Diagram for processes AD:

Computer Systems: A Programmer's Perspective (3rd Edition), Chapter 8, Problem 8.9HW , additional homework tip  3

Explanation:

  • In the above timing diagram, process “A” starts with “5” and end with “7”.
  • Process “D” starts with “1” and end with “8”.
  • Process “A” and “D” are concurrent with respect to each other because their corresponding executions overlap, that is, process “D” starts before the process “A” completes.

Therefore, the processes “AD” are run concurrently.

Diagram for processes BC:

Computer Systems: A Programmer's Perspective (3rd Edition), Chapter 8, Problem 8.9HW , additional homework tip  4

Explanation:

  • In the above timing diagram, process “B” starts with “2” and end with “4”.
  • Process “C” starts with “3” and end with “6”.
  • Process “B” and “C” are concurrent with respect to each other because their corresponding executions overlap, that is, process “C” starts before the process “B” completes.

Therefore, the processes “BC” are run concurrently.

Diagram for processes BD:

Computer Systems: A Programmer's Perspective (3rd Edition), Chapter 8, Problem 8.9HW , additional homework tip  5

Explanation:

  • In the above timing diagram, process “B” starts with “2” and end with “4”.
  • Process “D” starts with “1” and end with “8”.
  • Process “B” and “D” are concurrent with respect to each other because their corresponding executions overlap, that is, process “D” starts before the process “B” completes.

Therefore, the processes “BD” are run concurrently.

Diagram for processes CD:

Computer Systems: A Programmer's Perspective (3rd Edition), Chapter 8, Problem 8.9HW , additional homework tip  6

Explanation:

  • In the above timing diagram, process “C” starts with “3” and end with “6”.
  • Process “D” starts with “1” and end with “8”.
  • Process “C” and “D” are concurrent with respect to each other because their corresponding executions overlap, that is, process “D” starts before the process “C” completes.

Therefore, the processes “CD” are run concurrently.

Completed table:

Process pairConcurrent?
ABNo
ACYes
ADYes
BCYes
BDYes
CDYes

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
assume a system has 6 identical resources and N processes competing for them. each process can request at most 2 resources. what is the maximum value of N for the system to be deadlock free?
We are dealing with 6 processes p1;p2; : : : ;p6:(a) Processes p1;p2 in p3 arrive at time 2 ms, respectively. Each of those processesneeds 5 ms of CPU time.(b) Process p4 arrives at time 10 ms and needs 3 ms of CPU time.(c) Processes p5 in p6 arrive at time 19 ms. Process p5 needs 7 ms, while process p6needs 4 ms of CPU time.Scheduling is preemptive, where there process switch takes 1 ms. For the Round-Robinalgorithms with quantum 2 ms illustrate the execution of those processes on a timeline.Then determine the average turnaround time.
Let the processes P1, P2, P3, and P4 be given. They arrive in the system at the same time in this order. The processes have the following service times (in time units):    Process P1 P2 P3 P4 Service time (CPU burst) 53 17 68 24  For the scheduling method "Round Robin" (RR), specify the average execution time (average turnaround time) and the number of context switches. The time quantum q is set to 20 time units. You must show your calculations. You will not have to draw Gantt charts. Note: For RR, processes execute in order of their ID (i.e., P1-P2-P3-P4).
Knowledge Booster
Background pattern image
Computer Science
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
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education