Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is pre-emptive shortest remaining-time first. Process Arrival Time Burst Time P₁ 0 11 P₂ 6 3 P3 7 1 ра 8 3 The absolute difference between the average turnaround time and the waiting time and of these processes is milliseconds. N

Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is pre-emptive shortest remaining-time first. Process Arrival Time Burst Time P₁ 0 11 P₂ 6 3 P3 7 1 ра 8 3 The absolute difference between the average turnaround time and the waiting time and of these processes is milliseconds. N

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

I don't think my answer is true. Can you help me?
FirstComeFirstServe only
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…
V. Round Robin and SJF comparison Process Arrival Time CPU Burst Time P1 9. P2 4 4 P3 1 P4 8. For each of the following algorithms, draw a Gantt chart and calculate the average wait time and turn around time. 1. Reund robin with quantum=1 time unit 2. Round-robin with quantum=3 time-units 3. SJF W/ preemptien (Shertest Remaining Time First), assume quantum=3 4. SJF wlo preemption 5. FGFS
Given a set of jobs {J1, ... , Jn}, each job Ji = < ti, wi > has a required processing time ti and aweight wi. Design an efficient algorithm (pseudo code) to minimize the weighted sum of overall completion times ∑ni=1wiCi, where Ci is the completion time of job i. What is the time complexityof your algorithm? Note: You first need to briefly explain your ideas to solve the problem, e.g. what data structures are used, how the intermediate results are saved, which sorting strategy is used, and why the final results are correct;
Consider the following functions as time complexities of some algorithms. (a) First write the worst-case runtime of each algorithm in Big-O notation. (b) Then arrange functions from low to high (Consider their Big-O notations as you arrange them; as n grows, the function that grows slower should come sooner than the one that grows faster). (c) Arbitrary, select TWO of arrangements in part (b) and for each one of them justify why you have chosen such an ordering for the corresponding function. Provide formal proof. For example if fl<=f2<= f3<= f4<=f5 you may choose to formally justify why (1) fl<=f2 and why (2) f4<=f5 . fI(n)=n², f2(n)=210 nlogn, f3(n)=3", f4(n)=n, f5(n)=1, f6(n)=5*logn, f7(n)= n", f8(n)=4 n*n, f9(n)=2log(n³)
If a time quantum used in round-robin preemptive CPU scheduling is allowed to grow too large, the algorithm degenerates to: w m w ww ww w wwwww w www a) Shortest-Job-First (SJF). b) Shortest-Time-Remaining (STR). c) Job Exclusion (JBE). d) First-Come-First-Served (FCFS) e) Round Robin (RR)
There are 12 processors in a network, each processor stores a different piece of information about a certain task. Assume that the time required to send information from one processor to another processor regardless of its size takes 100 microseconds. It is required that all the information (12 different pieces) about this task be available to all of the 12 processors. a) Find an algorithm to solve this problem in minimum time? b) Calculate its complexity and efficiency? c) Implement the above problem and submit the code.
analysis and design of algorathem