. Consider a system with: five processes, P0 P4, three resource types, A, B, C. Type A has 10 instances, B has 5 instances, C has 7 instances. At time TO the following snapshot of the system is taken. Is the system in a safe state? Max Need Allocated Available A A C A B C PO 5 1 3 3 P1 2 2 2 P2 9 3 2 P3 2 2 2 1 1 P4 4 3 3 2 Is the system in a safe state? Write the steps, that leads to your conclusion.

. Consider a system with: five processes, P0 P4, three resource types, A, B, C. Type A has 10 instances, B has 5 instances, C has 7 instances. At time TO the following snapshot of the system is taken. Is the system in a safe state? Max Need Allocated Available A A C A B C PO 5 1 3 3 P1 2 2 2 P2 9 3 2 P3 2 2 2 1 1 P4 4 3 3 2 Is the system in a safe state? Write the steps, that leads to your conclusion.

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: In addition to the processes listed above, the system also can enter an idle state (which there is no consumption for CPU resources. This idle state identified as p_idle). This state should be appearing in drawing Gantt Chart whenever the system has no other available processes to run. Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. For each of the scheduling algorithms: FCFS (first come, first serve) Preemptive, Round robin scheduling algorithm: The length of a time quantum is 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue. Draw a Gantt chart to show how these processes would be scheduled. Give the turnaround time (total time from first arrival into ready state until cpu-burst is completed) of each process. Give the waiting time (total time spent…
Consider a system consisting of four processes and a single resource. The current state of the claim and allocation matrices are 44 A = What is the minimum number of units of the resource needed to be available for this state to be safe?
Given the following Bankers Algorithm representation for a single resource among 4 processes. Does the allocation of resources represent a safe or unsafe condition? Has Max Has Max A06 A 1 6 B05 B 2 5 C05 C 1 4 DO 7 D 4 7 Free: 10 Free: 2 Safe Unsafe Cannot be determined
Considering a system with five processes P0 through P4 and four resources of type A, B, C,D. Suppose at time t0 following snapshot of the system has been taken: Allocation A B C D Max A B C D Available A B C D P0 0 0 1 1 0 0 1 2 1 4 2 1 P1 10 0 0 1 7 5 0 P2 1 3 5 4 2 3 5 6 P3 0 6 3 2 0 6 5 2 P4 0 1 1 4 0 6 5 6 Answer the following questions using the banker’s algorithm: What is the content of the matrix Need? Is the system in a safe state? Find the safe sequence If a request from process P1 arrives for (0,4,2,0), can the request be granted immediately?
Suppose that an operating system supports two kinds of sequential processes: high-priority interactive processes, and low-priority non-interactive processes. The behavior of the high-priority processes is to alternate between periods of computation of duration Tc and periods of blocking (waiting for input) of duration Tb. The behavior of the low-priority processes is to compute constantly, with no blocking. The operating system’s scheduling policy is round-robin with a quantum q, where Tc < q. Scheduling decisions are made only when a quantum expires, or when the running process blocks. The scheduler selects a low-priority process to run only if no high-priority processes are ready. Suppose there is one high-priority process and one low-priority process in the system, and that both processes will run for a long time. For what fraction of the time does the low-priority process run?
To not let any process wait longer than 500 ms, a system developer programs the Round Robin procedure with a dynamic time quantum size. With ‘n’ processes ready, the time quantum Q is set to 500 ms/n. What do you think of this scheduling strategy? (In which situations is this strategy feasible, and when is it not? Are there edge cases?) Explain your reasoning.
Suppose processes P1-P4 with the given priorities and resource allocations. 1 is the highest priority and 4 is the lowest priority. Let us also assume that the "no preemption" condition is now relaxed by allowing preemption of resources by processes of higher priority. For example, P3 may preempt P2 or P4 if it needs a resource which they are holding. If P3 preempts one of these processes, say P4, then P4 release all the resources it is holding. Show one sequence of events in which resources are allocated to the 4 processes and the resulting preemptions, if any, until all new requests are serviced. Current allocations are shown below. Each resource has 4 instances. Try to minimize the preemptions as they are expensive. Process ID Process Priority Current allocation New request R1 R2 R1 R2 P1 1 2 1 2 1 P2 3 0 1 1 0 P3 2 1 1 0 1 P4 4 1 1 2 1
Consider a computer environment in which there are 4 magnetic drives, 2 printers, 3 scanners, and 1 optical drive. Three processes P1, P2, P3 are using these resources. At any point in time, the allocations and requests for these resources are as follows. Allocations: Magnetic drive Printer Scanner Optical drive P1 1 P2 2 1 P3 1 Requests: Magnetic drive 2 Printer Scanner Optical drive P1 1 P2 1 1 P3 2 1 Is there any way that the processes can complete without deadlock? If yes, explain how. If not, explain why not.
Suppose a system has 5 processes, P = {P1, P2, P3, P4, P5}, and 4 resources, R = {R1, R2, R3, R4}, where there are 2 instances of R1, 1 instance of R2, 3 instances of R3, and 3 instances of R4. The current state of the system is defined by the following requests and assignments: P1 is requesting an instance of R3 and has been assigned an instance of R2; P2 is requesting an instance of R1 and has been assigned an instance of R3; P3 is requesting an instance of R4 and has been assigned an instance of R1 and an instance of R3; P4 is requesting an instance of R3; P5 is requesting an instance of R2 and has been assigned an instance of R4. Is there deadlock in this system? (Explicitly state yes, there’s deadlock or no, there isn’t.) If applicable, draw a wait-for graph or resource-allocation graph, and use the appropriate graph to justify your answer. If you conclude there is no deadlock, your justification should contain a sequence of execution for the processes which shows that…
A real-time system executing four different periodic tasks Ti(p,t) is given, with p and t representing the period and the execution time of the task, respectively. Each task's deadline matches its period p. The system is executing the following set of tasks: S = {T1(10,2), T2(4,1), T3(10,3), T4(7,1)}. Is this real-time system schedulable under Rate-Monotonic (RM) scheduling? Is this real-time system schedulable under Earliest Deadline First (EDF) scheduling? Explain your answers using the concept of overall CPU utilization.
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types X, Ý, and Z to three processes PO, P1, and P2. The table given below presents the current system state. There are 3 instances of type X, 2 instances of type Y and 2 instances of type Z still available. The system is currently in a safe state. Answer the following questions! Allocation Max X Y z X Y PO 0 1 8 4 3 (a) If PO requests 2 instances of Z during the P1 3 2 current state, can it be granted? Explain! (b) If P1 requests 2 instances of X during the P2 2 1 1 3 3 3 current state, can it be granted? Explain! CO
Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: In addition to the processes listed above, the system also can enter an idle state (which there is no consumption for CPU resources. This idle state identified as p_idle). This state should be appearing in drawing Gantt Chart whenever the system has no other available processes to run. Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. For each of the scheduling algorithms: FCFS (first come, first serve) Preemptive, Round robin scheduling algorithm: The length of a time quantum is 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue. Draw a Gantt chart to show how these processes would be scheduled. Give the turnaround time (total time from first arrival into ready state until cpu-burst is completed) of each process. Give the waiting time (total time…