Computer Systems: A Programmer's Perspective (3rd Edition)
Computer Systems: A Programmer's Perspective (3rd Edition)
3rd Edition
ISBN: 9780134092669
Author: Bryant, Randal E. Bryant, David R. O'Hallaron, David R., Randal E.; O'Hallaron, Bryant/O'hallaron
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
please write the program of the following question in C language or Shell/Bash Script
If you have many processes that are running concurrently, some code is a critical section if one of the following options among others is true : a. At least one process is reading O b. At least one process is writing c. All processes should be writing d. At least one process is reading and at least one process is writing e. All processes should be reading
Read each description of each Process Scheduler on the left and match it with the appropriate name on the right. This scheduler decides which processes in memory get time on the CPU. It is executed very frequently. This scheduler handles "swapping" of processes from main memory to mass storage. For example, it may swap-out processes that are waiting for I/O to complete. This scheduler selects spooled processes to load from the mass storage device into mai memory. It attempts to find a good mix of "I/O bound" and "CPU Bound" processes to maximize resource utilization. [Choose ] [Choose ] ✓ [Choose ] Cool Scheduler Schedulers aren't real; Nothing is real Short-term Scheduler Medium-term Scheduler Spool Scheduler Bound Scheduler Frequency Scheduler Swap Scheduler Long-term Scheduler
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
    Systems Architecture
    Computer Science
    ISBN:9781305080195
    Author:Stephen D. Burd
    Publisher:Cengage Learning
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning