Answered: Task 3 A system has 5 processes and 5… | bartleby

Systems Architecture

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 20VE

See similar textbooks

Related questions

Question

Task 3
A system has 5 processes and 5 types of resources. The current state of the system is as
follows:
Process Allocated (C)
Requested (R)
Available (A)
II₁
1 2 2 3 1
0 3 3 3 3
X 2 4 1 7
П2
2 1 20 1
6
23 23
II3
5 1002
9
3
20
ΠΑ
20 21 1
3
14 02
II5
201 10 12 4 5 0 5
What is the smallest values of \ for which the system is in a safe state? Justify your
answer.

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Blurred answer

Similar questions

An operating system contains 3 user processes, each process requiring 2 units of the resource R. The minimum number of units ofR required such that there is no possibility of deadlock on R is A 6 B 3 С 5 D 4
A job scheduler gets work requests with a priority of execution attached to it, in the following sequence. The higher the priority value, the more important task execution.Work ID: 464 212 110 840 976 3433 2 3 1 2 2 Priority: 3 2 3 1 2 2Create a treap for the jobs that are set to run. What will the treap look like after the highest priority jobs have finished execution and thus left the treap?
An operating system has a total of three user processes, and each of these processes uses a total of two units of the resource R. The total number of units that R is used up by the operating system is twelve. The absolute minimal number of R units that must be used to eliminate the possibility of any deadlocks happening is
Operating System
Downvote for incorrect answer. Likes for correct ones
There are six processes in three priority classes. Class 1 has the highest priority. (The amount of CPU time needed by each process is written in brackets.) • Class 1: II₁ (13 ms), II3 (8 ms), II6 (6 ms) • Class 2: II₂ (10 ms), II5 (4 ms) Class 3: II4 (12 ms) The system is using the following algorithm: The scheduler picks a process from the highest (non-empty) class. To schedule processes within the same class, the Round-Robin algorithm is used with quantum 5 ms. Process switch takes 1 ms. (a) Draw the schedule for the above processes on a timeline. (b) Mirko decided to modify the above algorithm: After each burst (i.e. when the quantum experies) the process is degraded by one class (unless it is already in Class 3). Draw the schedule for Mirko's modified algorithm.
An operating system uses a total of two units of the resource R for each of its three user processes. The operating system uses a total of 12 units of R. The absolute minimum number of R units that must be used to guarantee that there are no deadlocks is
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
A process may be blocked and located into the corresponding event queue due to waiting for an event of a specific type, however it recommends thata process be able to only in one event queue at a time as illustrated in the following figure. Ready Queue Release Admit Dispatch Processor Timeout Event 1 Queue Event 1 Оссurs Event 1 Wait Event 2 Queue Event 2 Occurs Event 2 Wait Event n Queue Event n Wait Event n Occurs a) Give an example in which you can demonstrate how to allow a process to wait for more than one event at the same time. b) In that circumstance, by what meanstransform the queuing structure of the figure to support new feature? Provide the definition of the structures in C/C++ with example.
Real Time Scheduling: Select all statements below that are true EDF scheduling assigns the highest priority to a process with the smallest remaining time until its deadline. RM scheduling assigns a higher priority to processes with shorter periods. Rate Monotonic (RM) scheduling works by dividing the total amount of time available into an equal number of shares, and then each process must request a certain share of the total when it tries to start. If a process has period p, it is activated every p units of time. A real-time system is schedulable under Earliest Deadline First (EDF) when its overall CPU utilization is less than or equal to 1. A real-time system is schedulable under RM when its overall CPU utilization is less than 1.
Suppose you are given n tasks J = {j1, j2, · · · jn}.Each task ji has two parts - a preprocessing phase which takes pi units and a main phase whichtakes fi units of time. There are n machines that can execute the main phases of the jobs in parallel.However, the preprocessing phases need to be executed sequentially on a special machine. Thecompletion time of any schedule is the earliest time when all tasks have finished execution. Designa greedy algorithm which produces a schedule that minimizes the completion time. Here, youneed to give formal proof of correctness. Your proof should not exceed one side of an A4 sheet.Anything more than that will not be considered by the evaluator. Provide only pseudocode.
In a timesharing OS we have the following cpu timeline for two tasks X and Y. The timeslice is 1s.Both tasks are available in the system at the same time t=9:00:00.000 and order of arrival is the obviousX followed by Y. (The decimals reflect milliseconds if they showup in an indicated time reference.) There are no other processes (tasks) in the system other than X,Y. 1234567890 XYXYX--YXY The time line 1 indicates that at t=9:00:00s task X starts its execution and when t=9:00:01s is reached task Y takes over. The time line 1 indicates the 'first second' and time line 0 indicates the 'tenth second' above.Task Y completes its execution at t=9:00:10s, the completion of the tenth second since X started its execution. Task X has completed its execution earlier. (a) What is the total number of context switches starting from prior to t=9:00:00s (e.g. t=8:59:59.999) through thecompletion of $Y$? answer is 16s (b) What is the turnaround time for Y? answer is 10s (c) What is…

SEE MORE QUESTIONS

Recommended textbooks for you

Systems Architecture

Systems Architecture

Computer Science

ISBN:

9781305080195

Author:

Stephen D. Burd

Publisher:

Cengage Learning

Operations Research : Applications and Algorithms

Operations Research : Applications and Algorithms

Computer Science

ISBN:

9780534380588

Author:

Wayne L. Winston

Publisher:

Brooks Cole

Systems Architecture

Systems Architecture

Computer Science

ISBN:

9781305080195

Author:

Stephen D. Burd

Publisher:

Cengage Learning

Operations Research : Applications and Algorithms

Operations Research : Applications and Algorithms

Computer Science

ISBN:

9780534380588

Author:

Wayne L. Winston

Publisher:

Brooks Cole

SEE MORE TEXTBOOKS