Consider that we have 3 groups of processes (group 1, group 2 & group 3). • Only one process can be executing in its critical section from group 3, provided that no processes are executing in their critical sections form groups I and 2. • At most 10 processes can be executing in its critical sections from group 2, provided that no processes are executing in their critical sections form groups 1 and 3. • An infinite number of processes can be executing in its critical sections from group 1, provided that no processes are executing in their critical sections form groups 2 and 3. Shared data and semaphores: Code Group 1 Group 2 Group 3

Consider that we have 3 groups of processes (group 1, group 2 & group 3). • Only one process can be executing in its critical section from group 3, provided that no processes are executing in their critical sections form groups I and 2. • At most 10 processes can be executing in its critical sections from group 2, provided that no processes are executing in their critical sections form groups 1 and 3. • An infinite number of processes can be executing in its critical sections from group 1, provided that no processes are executing in their critical sections form groups 2 and 3. Shared data and semaphores: Code Group 1 Group 2 Group 3

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

Similar questions

Suppose there are five processes, their arrival time and running time are listed as follows. Adopt FCFS and SJF, respectively, give the schedule order and average waiting time. Give the schedule order of SJF. Compute the average waiting time of SJF. Process Arrival time Running time P1 P2 P3 P4 0 3 4 5 3 10 6 1
Consider the following processes:Process Arrival Time Service Time A 0 4 B 1 3 C 2 3 D 2 2 E 3 1 F 5 3 Show (draw the schedule, x-axis is time, and one row for each CPU) how the aboveprocesses execute over time on a system with 2 CPUs. Compute the average turnaroundtime for all processes and the average utilization for each CPU under each of the following schedulers: (a) FCFS with a single Ready Queue. A process gets scheduled once one of the CPUsis available. When both CPUs are available, we select CPU1. (b) FCFS with a Ready Queue per CPU. Processes A, B, and C go to CPU1 and processesD, E, and F go to CPU2. (c) HRRN with a single Ready Queue. A process gets scheduled once one of the CPUsis available. When both CPUs are available, we select CPU1.
22. A system has two processes and three identical resources. Each process needs a maximum of two resources. Is deadlock possible? Explain your answer 23. Consider the previous problem again, but now with p processes each needing a maximum of m resources and a total of r resources available. What condition must hold to make the system deadlock free? please answer the second question...
Consider a system with five processes and three resource type. Resource type X has 7 instances, resource type Y has 10 instances and resource type Z has 5 instances. Suppose that at time 0, the following snapshot of the system has been taken. Suppose B request 2 additional instances of resource type X and 1 instance for resource type Y, can the request be granted? Is the system safe? If yes, what is the safe sequence?
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.
Consider a system with three processes (P1, P2, and P3) and four resources (R1 has one instance, R2 has two instances, R3 has one instance, and R4 has three instances). The Snapshot at time Tx has the following situation: P1 holds one instance from Resource R2 and Request Resource R1 P2 holds Resource R1, one instance from Resource R2 and Request Resource R3 P3 holds Resource R3 and Request one instance from Resource R2 Draw the Resource Allocation Graph, then check if the system in safe state or not? If yes? What is the safe sequence?
Consider the system with 5 processes <P0, P1, P2, P3, P4> and three resources types (4)A=13, B=13 and C=9. The following information has been attached.
Given a system of 4 processes with a set of constraints described by the following precedence relation: › : {(P1, P3), (P1, P4), (P2, P4)} The processes access memory locations according to the table attached. Answer the following questions about the system (you are not required to draw any graphs): 1. Is the system determinate for all interpretations of its processes? Explain why. 2. Is the process pair (P3, P4) mutually non-interfering (MNI)? Explain why. 3. If the process pair (P3, P4) is not MNI, what modifications are necessary to guarantee that the system is determinate for all interpretations?
List/explain 3 different ways that a system can recover from deadlock. Know the necessary conditions for deadlock and explanations of each. Why is it necessary to have an atomic instructions for providing access to a critical section? Consider a system with 5 processes (A, B, C, D and E) and 5 single instances of resources (Q, R, S, T, U) with given assignments (A holds R and wants T, C holds T and wants Q, etc). Construct a resource allocation graph. Determine if deadlock occurred. Draw a wait-for graph of the system. It's a C Programming
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?
In deadlock avoidance, using banker’s algorithm, what would be the consequence(s) of (i): A process declaring its maximum need as maximum possible for each resource. In other words, if a resource A has 5 instances, then each process declares its maximum needs as 5. (ii): A process declaring its minimum needs as maximum needs. For example, a process may need 2-5 instances of resource A. but it declares its maximum need as 2.
Problem No. 2 USE GANTT CHART FOR SHOWING SOLUTION SEE NEXT IMAGE FOR THE EXAMPLE OF NEEDED SOLUTION Given the process stream: Process Arrival Time Burst Time Memory Size A 0 6 9K B 1 8 5K C 2 4 8K D 3 5 7K Assume: Partition: 12:6:6:6 CPU Scheduling – Shortest Job First Job Selection Algorithm – First Fit Compute IF, EF, and % MU. Process Time the Process Starts Processing Time the Process Ends Internal Fragmentation at this Time External Fragmentation at this Time % Memory Utilization In What Partition Will the Process Be Allocated? A B C D