HomeworkLib
Question

Answer the following questions related to burst time prediction. A. Discuss why it is important to...

Answer the following questions related to burst time prediction.

A. Discuss why it is important to know the length of the next job or CPU burst and which scheduling algorithm requires future knowledge.

B. Estimate the burst times under the following conditions:

Tau = 12       Alpha=.25

Actual observed burst times are: 10, 15, 13, 10

C. Estimate the burst times under the following conditions:

Tau = 12       Alpha=.75

Actual observed burst times are: 10, 15, 13, 10

D. What is the effect of the Alpha value in calculating CPU bursts?

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

d) i think alpha is constant and doesnt rellates to burst time .as we can see in above examples also with increase in alpha value some times the next burst time increses and some time it decreses .

0 0
Add a comment
Know the answer?
Add Answer to:
Answer the following questions related to burst time prediction. A. Discuss why it is important to...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • 2. Answer the following questions related to burst time prediction. C. Estimate the burst times u...

    2. Answer the following questions related to burst time prediction. C. Estimate the burst times under the following conditions: Tau = 12       Alpha=.75 Actual observed burst times are: 10, 15, 13, 10 D. What is the effect of the Alpha value in calculating CPU bursts?

  • Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:

    Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:Processburst TimePriorityP1103P211P323P414P552For each of the scheduling algorithms, FCFS, Shortest-Job-First (SJF, non-preemptive), Priority (smaller priority number implies higher scheduling priority), and RR (quantum = 1) do the following.Draw a Gantt chart to show how these processes would be scheduled.Give the turnaround time (total time from the first arrival into ready state until CPU-burst is completed) of each process.Give the waiting time (total time spent in the Ready state) of each process.Give...

  • Q2. Consider the following processes with arrival time and burst time. 20 Marks Process Arrival Time...

    Q2. Consider the following processes with arrival time and burst time. 20 Marks Process Arrival Time Burst Time P16 29 0.0 P21 19.0 12 P32 22.0 13 P41 30.0 25 Calculate waiting time and average waiting time Round Robin (R-R) scheduling algorithm by using the following Quantum/Time slice: a. Quantum/Time Slice = 8 b. Quantum/Time Slice = 16 Q3. Calculate the CPU Utilization and Idle time by considering 35% I/O wait and number of processes are from 1 to 5....

  • Consider the following set of processes, with the length of CPU burst in milliseconds.

    Consider the following set of processes, with the length of CPU burst in milliseconds. Process PI P2 P3 P4 P5 Arrival time 00 02 03 06 30 Burst time 10 12 14 16 05 Draw a Gantt chart that illustrates the execution of these processes using the preemptive shorte st job first (SJF) algorithm. Hence find the average waiting time. Draw a Gantt chart that illustrate the execution of these processes using preemptive priority scheduling algorithm. Given priority of each...

  • Consider the following set of processes (P1 arrived at t=0; burst time=10), (P2 arrived at t=2:...

    Consider the following set of processes (P1 arrived at t=0; burst time=10), (P2 arrived at t=2: burst time=8). (P3 arrived at t=3; burst time=3), (P4 arrived at t=10; burst time=4), (P5 arrived at t=12: burst time=1). (P6 arrived at t=15; burst time=4). At (t=20) using RR (Q=3), as process scheduling algorithm, process will be handled P1 Ο P20 P3 O P4 P5 a P6 о

  • This assignment requires you to create simulations for different scheduling algorithms commonly employed by operating systems...

    This assignment requires you to create simulations for different scheduling algorithms commonly employed by operating systems to achieve multiprogramming. All problems in this assignment assume the following: The simulations you will be creating are for a uniprocessor system (single CPU). Processes in these simulations will require CPU bursts of one or more time units followed by I/O bursts of one or more time units. For simplicity’s sake, when more than one process is executing its I/O burst at the same...

  • Please answer the following question in C++ language Consider the following set of processes, with the...

    Please answer the following question in C++ language Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process            Burst Time      Priority P1. 7 5 P2 2 4 P3 11 3 P4 9 1 P5 5 3 The processes are assumed to have arrived in the order P1,P2, P3, P4, P5, all at time 0. a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive...

  • Please answer the following question in C++ language. Thank you. Please answer all the parts. The...

    Please answer the following question in C++ language. Thank you. Please answer all the parts. The following processes are being scheduled using a preemptive, round robin scheduling algorithm. Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. In addition to the processes listed below, the system also has an idle task (which consumes no CPU resources and is identified as I ). This task has priority 0 and is scheduled whenever the system...

  • Questions 12-14 are related to the following: Assume the student commuting time to the IUPUI campus...

    Questions 12-14 are related to the following: Assume the student commuting time to the IUPUI campus is normally distributed. To build a 95% confidence interval for the mean commuting time for all IUPUI students, a random sample of n = 5 students provided the following times (shown in minutes). x 15 12 18 25 30 12 The variance of the mean x̅ is a 54.5 b 45.6 c 10.9 d 8.7 13 The margin or error for a 95% interval...

  • please use these results of a growth curve experiment to answer the following questions Questions 1)...

    please use these results of a growth curve experiment to answer the following questions Questions 1) Plot the OD600 readings and cell concentration for each time point on a scatterplot with a line connecting the points. Have the measured data (OD600 and cell concentration) on the y-axis against the time on the x-axis using Excel (or other computer based data/graphing program). It is helpful to set the y-axis on a log scale for the cell concentration measurements. 2) Can you...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT