Please do fast and solve both parts Q1) (4 marks)In a simple priority-driven pre-emptive scheduler, three periodic tasks T1, T2, and T3 and two background(BG) tasks T4 and T5 are scheduled. The periodic task T1 has the highest priority, executes once every 20ms, and requires 5 ms of execution time. The periodic task T2 requires 5 ms of execution time every 50 ms.The periodic task T3 requires 5 ms of execution time every 100 ms. The BG T4, and T5 each requires 100 msof execution time. Assume all tasks start at time 0 ms.(1) Determine the time T4 and T5 will complete.(2) Draw the chart.05Q2) (3.5 marks)Table below shows the mapping between process requests (PO → P3) and resource allocation (A, B, and Cresources). A has 5 instances, B has 1, and C has 5 instances.AllocationRequestAvailableABCABCABCPO010000000P1200202P2303010P3002002(1) Is there a sequence for processes that will allow deadlock to be avoided? If yes, what is it?(2) If P2 increases its request for C resources by 2 more, what will the sequence be, if any?

To answer the queries based on the preemptive scheduler table and the task information provided in…

Answered: Q1) (4 marks) In a simple…

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 8RQ

See similar textbooks

Similar questions

in C++ please create a Priority : -pre-emptive algorithm code: here are information that will help you Tasks: • Lab 4: Process management • Review Process management algorithms Definitions: (in terms for this lab not formal definitions) • Preemptive: When a new process arrives and has a higher priority than the current running process, Then the current running process is paused and put back in the waiting queue, and the new process starts executing. In most systems it will automatically interrupt the current running job when the new job arrives, however some systems use a predetermined interval (a certain number of time units), to check for new jobs. • Non preemptive: Take no action when a process with higher priority arrives,when a new process with a higher precedence arrives current running process need to finish first before the new process goes Oxford definition: Preempt – to take action in order to prevent (an anticipated event) from happening; forestall. • Metric: a metric is…
Pre-emptive vs noND-pre-emptive scheduling should be distinguished.
Here are the top five (5) factors that should be considered while formulating a process scheduling policy.
Critical Sections - Select all of the following statements that are true A critical section is a segment of code in which a process has write-access to data or resources that are shared with at least one other process. Every process waiting to enter a critical section must be allowed to enter it at some point. No eternal waiting must be possible. In a system consisting of n processes, a critical section protected by a mutex variable can be accessed by more than one process at a time. A process not executing in a critical section must not prevent other processes from entering the critical section. Critical sections must never contain data shared by multiple processes. O DELL W
Assume the following transection T1 and T2 executing in serial schedule. The Initial value of A=20 and B=10. Find the result of serial schedule T1 followed by T2, A=………….., B=……….. Find the result of serial schedule T2 followed by T1, A=………….., B=………..
Round Robin Process Suppose we have a four (4) core processor and all processes are designed to be multi-threaded. Now, like all processors with more than one core, they have the ability to perform multiple tasks at the same time. If there are four (4) with the following CPU and I/O cycles according to the table below, calculate the times for the Round Robin scheduling process (view image): Where A,B,C,D correspond to A=6, B=3, C=5, D=8.
Process Scheduling Multiprocessor systems use multiple CPUs to perform various tasks. This increases throughput and reduces response time. In this problem, a multiprocessor system has a certain number of processors. Each processor has the ability to schedule a limited number of processes in one second. However, after this scheduling, the processor's ability is reduced to floor(ability/2). Given the processor's abilities and the number of processes, what is the minimum time required to schedule all the processes in the system? Example n = 5 (number of processors and size of ability[]) ability = 13, 1, 7, 2, 4] processes = 15 This optimal solution is: 1. First, the processor with ability = 7 schedules 7 processes in one second. Now, ability = (3, 1, 3, 2, 4] because 7 was reduced to floor(7/2). There are 15 - 7 = 8 remaining processes. 2. Second, the processor with ability = 4 is used. After that, ability = [3, 1, 3, 2, 2). Remaining processes = 8 - 4= 4.
In priority scheduling, support for real time processing is allowed All of the above The processes at the same priority level can be handled via First-Come-First Serve scheduling The processes at the same priority level can be handled via Round Robin scheduling
Full form of SRTF scheduling algorithm a) Shortest Remaining Time First. ' b) Shortest Rest Time First. ¢) Shortest Review Time First. d) Non of the above.
A single-CPU system has four processes, P1, P2, P3 and P4 in the ready queue. The execution times and I/O needs for these processes are given below. All times are in ms. (hint: when a process starts an IO operation, it is removed from the ready queue and put back at the end of the queue only when it completes its IO). Process P1: Arrives at 0ms, needs 23ms of CPU time. Performs I/O for 5ms after 10ms of its execution time, then another 5ms after 20ms of its execution time. Process P2: Arrives at 3ms, needs 12ms of CPU time. Performs I/O for 10ms after 5ms of its execution time. Process P3: Arrives at 1ms, needs 15ms of CPU time. Performs I/O for 1ms after 7ms of its execution time. Process P4: Arrives at 2ms, needs 8ms of CPU time. Performs I/O for 5ms after 4ms of its execution time. We assume that the CPU is idle if no one of these four processes is using it. Using Round Robin scheduling algorithm with a Time Quantum of 4ms and ignoring the context switch time, determine: a) The…
There are two separate methods of scheduling, and they are preemptive and nonpreemptive scheduling, respectively.
Question 1 (Task Scheduling Suppose that we have n tasks to schedule on a computer with a single-core processor where task i takes t, time units to finish. We would like to run all of the n tasks while minimizing the total waiting time for all tasks. Assuming that the first task starts at t = 0, the waiting time wi for task i is the total time before it is started. For example, if we have three tasks with execution times t₁ = 5, t₂ = 3, and t3 = 2 scheduled to run in the order (C1, C2, C3), the waiting times are w₁ = 0, w₂ = 5, and w3 = 5 + 3 = 8. If they are scheduled in the order (C3, C2, C₁), the waiting times become w3 = 0, w22, and w₁ = 2 + 3 = 5. Propose a greedy algorithm that finds the optimal scheduling for the n tasks with the minimum waiting time. Establish the running time of your algorithm. Prove the optimality of your algorithm.

SEE MORE QUESTIONS

Recommended textbooks for you

Systems Architecture

Computer Science

ISBN:

9781305080195

Author:

Stephen D. Burd

Publisher:

Cengage Learning

Systems Architecture

Computer Science

ISBN:

9781305080195

Author:

Stephen D. Burd

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS