ZuoTi.Pro
Question

Given a system using the shortest-job-first algorithm for short-term scheduling and exponential a...

Given a system using the shortest-job-first algorithm for short-term scheduling and exponential averaging with α=0.5, what would be the next expected burst time for a process with burst times of 5, 8, 3, and 5, and an initial value for e1 of 10?

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

Homework Answers

Answer #1

d) the nenct burst can be al. ナestでmate [i] P 2 3 P L -th m aw ahle n 1 manne r2 ご5. 37-1

2 0
Add a comment
Know the answer?
Add Answer to:
Given a system using the shortest-job-first algorithm for short-term scheduling and exponential a...
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

  • I want this process in Shortest remaining time first job scheduling code in C and flowchart of th...

    I want this process in Shortest remaining time first job scheduling code in C and flowchart of the code in operating system Process Pl P2 P3 P4 P5 Arrival Time Burst Time Priority Process Pl P2 P3 P4 P5 Arrival Time Burst Time Priority

  • Briefly explain how the Shortest Remaining Time scheduling algorithm differs from Shortest Job Next.

    Briefly explain how the Shortest Remaining Time scheduling algorithm differs from Shortest Job Next.

  • What is the other name for Shortest Job First Preemptive Algorithm? What are the 5 different...

    What is the other name for Shortest Job First Preemptive Algorithm? What are the 5 different states a process can be in scheduling (Look into process state diagram)? Shortest Job First is like Priority Scheduling with the priority based on ______ of the process? ________ effect is the primary disadvantage of First Come First Serve Scheduling algorithm. How does Multi Level Feedback queue prevent starvation of processes that waits too long in lower priority queue?

  • In the videos we show that Shortest Job First is the best algorithm with respect to...

    In the videos we show that Shortest Job First is the best algorithm with respect to average turn around time when there is no Input Output (I/O) burst. When there is I/O bust we have three variants: Shortest remaining burst time first (SRBTF) Shortest next burst time first (SNBTF) Shortest total burst time first (STBTF) Does SRBTF have the least average turnaround time? If Yes prove it in explanation, If no give an example schedule which is not SRBTF but...

  • Given the following set of processes with corresponding execution times (in ms), arrival times and priority...

    Given the following set of processes with corresponding execution times (in ms), arrival times and priority (1 – highest).  For each scheduling algorithm: Construct a table showing which process is active and for how long until all processes are completely serviced (as done in class). Calculate the average waiting time and turnaround time. Process ID Burst (ms) Arrival time P1 9 0 P2 12 0 P3 3 0 P4 30 0 P5 20 0 P6 10 0 First Come First Serve...

  • Question 14 1 points The following table gives information about a number of processes, their arrival...

    Question 14 1 points The following table gives information about a number of processes, their arrival times, and their initial CPU burst times (given in milliseconds). Note that low numbers denote high priorities. If processes are equal, according to all the criteria of the scheduling algorithm used, then order them by process number (1-4). Process Arrival Time (ms) Burst Time (ms) Priority Suppose non-preemptive Shortest-Job-First (SJF) scheduling is used, what is the average wait time for the processes? A 6.5...

  • operation system please i need the answer now VULTUR Using FCFS (First-Come First-Served) scheduling algorithm, find...

    operation system please i need the answer now VULTUR Using FCFS (First-Come First-Served) scheduling algorithm, find the Average waiting time for the below processes Process Arrival time Service Time P2 P3 P4 TTT Anal 3(12pt) T- Pathp Can there be starvation in first come first serve based scheduling algorithm? Explain. TTT Arial v 3 (12pt) T. 5. 5. Path:p 18 How does Processor scheduling help us in achieving high throughput? Name the three types of Processor scheduling? TT T Arial...

  • 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...

  • Opearting system 5. [27pts.] Given the following set of processes, with arrival times, priorities, and the...

    Opearting system 5. [27pts.] Given the following set of processes, with arrival times, priorities, and the length of the CPU burst in ms: Process Arrival Time Burst time Priority P1 P2 P3 2 10 P4 (Note: a lower number means higher priority; processes P2- P4 arrive at the same time, in the given order) a. Draw a Gantt chart showing a FCFS scheduling algorithm. b. Draw a Gantt chart showing a non-preemptive Priority scheduling algorithm. Draw a Gantt chart showing...

  • The following processes are being scheduled using a preemptive, roundrobin scheduling algorithm. Each process is assigned...

    The following processes are being scheduled using a preemptive, roundrobin 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 has no other available processes to run. The length of a time quantum is 5 units....

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
ADVERTISEMENT