Consider the information on the following set of processes: 田 Process Table 2: Set of Processes A В D F Arrival Time 4 7 10 12 Service Time 5 3 4 1 You are required to identify TWO (2) uniprocessor scheduling policies based on set of processes in Table 2. Take note to select policies that favour short processes but may cause long processes to starve. a. Name the TWO (2) uniprocessor scheduling policies. b. Referring to your answer in (a), compute the normalized turnaround time for ONE (1) pre-emptive policy. c. Explain the possible cause of the starvation on the selected policy.

Consider the information on the following set of processes: 田 Process Table 2: Set of Processes A В D F Arrival Time 4 7 10 12 Service Time 5 3 4 1 You are required to identify TWO (2) uniprocessor scheduling policies based on set of processes in Table 2. Take note to select policies that favour short processes but may cause long processes to starve. a. Name the TWO (2) uniprocessor scheduling policies. b. Referring to your answer in (a), compute the normalized turnaround time for ONE (1) pre-emptive policy. c. Explain the possible cause of the starvation on the selected policy.

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

The table below shows a list of processes for a processor, the order in which they have arrived at the processor, and how many cycles of the processor each process will take to complete. Task ID Arrival order Cycles to completion Process A 1 12000 Process B 2 6000 Process C 3 2000 Using a first-come first-served scheduler, how many cycles will it take until Process B is completed? Using a round-robin scheduler with each process getting 2000 cycles in turn, how many cycles will it take until Process B is completed? Suggest a kind of scheduler to use when an operating system requires a lot of input/output from a user. Give a brief justification for your answer. Write no more than 100 words.
Observe the table (picture) and do the following: Draw a Gantt Chart for the following scheduling policies: 1. First Come First Served (FCFS) 2. Shortest Remaining Time First (SRTF - preemptive version of Shortest Job First) Convention: if two jobs have the same remaining time, choose job that arrived earlier first. 3. Round Robin (RR) scheduling policy with a quantum size of 2 units. Conventions: 1. If a job finishes before the end of its quantum, finish that quantum and begin a new one immediately. 2. If a job finishes its quantum at the same time as a new job (i.e., a new CPU burst for a job) arrives, place the job that just finished its quantum ahead of the newly arriving job in the job queue.
5. Consider the following set of tasks in a real-time system: Tasks Release time Execution time Absolute deadline T 1 40 T2 10 30 T 3 7 60 T 4 10 10 20 T 5 12 6 70 Perform EDF (Earliest Deadline first) scheduling on this task set.
Given in Table 1 is a set of five (5) processes with the priority, length of the CPU-burst time, and arrival time. Table 1 Process Arrival Time (ms) Burst Time (ms) Priority* P1 3 P2 1 2 1 P3 3 P4 7 P5 8 8 4. *Note: • A smaller priority number implies a higher priority. a) Compute the Waiting Time (WT) of each process in Table 1, and also compute their Average Waiting Time, for each of the following scheduling algorithms. i. Shortest Job First (SJF). ii. Pre-emptive Priority (PP) iii. Round Robin (RR) with quantum = 3 (ms).
A real-time operating system (RTOS) is required to process tasks sent to an Electronic Control Unit which controls the systems of a typical family car. Rate Monotonic Scheduling (RMS) is one of the preemptive scheduling algorithms under consideration for this task. Q6 What are the three key time parameters for any periodic task and four task states that need to be known when designing a scheduling algorithm for a system. (a) Rate monotonic scheduling (RMS) is one of the scheduling algorithms for non- interacting periodic tasks in a single core microprocessor. Explain how the total task utilisation Ur and utilisation upper bound U, can be used to assess if a task set of n tasks are schedulable. (b) Assuming there are four periodic tasks in a high-speed train control system with the following features as shown in Table Q6 C=execution time/task duration, D-Deadline and T=task period. (c) Task T T1 12 20 T2 15 3 T3 10 10 T4 3 12 12 Table Q6 Determine if the RMS algorithm can handle these…
1. Consider the arrival and burst time of five jobs specified in the table below. a. Apply the Round Robin operating system scheduling algorithm. b. Time quantum of the system is 4 units. c. Generate a table to identify the process id, exit time, turn around time, and waiting time. d. Generate a Gantt chart to show how/when each process is executed. e. Calculate the average turn around time of the processes. f. Calculate the average wait time of the processes. Process ID | Arrival Time | Burst Time 3 4 2 6. 10 4 5 6 Time Table Process ID Exit Time Turn Around Time Waiting Time 2 3 4 5 Gantt Chart Process ID Time # # 23 Average Turn Around time = Average waiting time = 23 %23 共壮 %23 %23 共
Just explain whole questions in one lines per part
The table below shows a list of processes P1 to P4 with their arrival times as well as their execution times. Use it to answer the following questions. Clearly show your workings. Processe Arrival Time Burst Time P1 3 ms 5 ms P2 0 ms 4 ms P3 4 ms 2 ms P4 5 ms 4 ms Using the First Come First Serve scheduling algorithm,calculate the average waiting time of the processes. Using time of the Shortest Remaining Time First (SRTF) scheduling algorithm, calculate the average waiting time of the processes. Using Shortest Job First (SJF) algorithm, calculate the average turn-around time for the processes.
Process PI P2 P3 P4 P5 Buast time 2 1 8 4 5 Priority (2*xx) %5 (2xxx) 5 (2*XX) 0/0 5 (2*XX) do 5 (2*xx) do 5 ✓ 11 Value of XX is 5 All processes Arrives at time + = 0 ms. Draw the Gantt chart for priority scheduling (A larger priority number implies higher priority)
Course Title : Operating SystemQuestion : For deadlock avoidance one of the popular algorithm is Banker’s Algorithm. If 5 processes P0, P1, P2, P3 and P4 are given with their Allocation, Max and available resource. Please answer following question. How you will calculate the need matrix of each process? How you will check the safety state of the processes? Calculate safe sequence. How you will calculate Total resources that are needed for this system?
Use the following table of processes and burst time to answer the questions P3 P4 P5 Process Burst time PI P2 120 60 180 50 300 1) Draw Gantt charts illustrating the execution of these processes using FCFS, SJF, and RR (quantum = 50) scheduling. 2) What is the turnaround time of each process for each of the scheduling algorithms? 3) What is the waiting time of each process for each of the scheduling algorithms? 4) Which of the schedules results in the minimal average waiting time (over all processes)?
Draw the Gantt chart, Calculate the Average Turnaround Time AND Average Waiting Time for the following processes using Priority Scheduling. Assume all processes arrive at the same time at time 0. Processes Priority CPU BURST Time P1 4 8 P2 3 10 P3 0 4 P4 1 2