Question

1. What is the average waiting time for Processes If the Operating System uses the Shortest-Job-First...

1. What is the average waiting time for Processes If the Operating System uses the Shortest-Job-First (SJF) Scheduling Algorithm?

(P1=5 ms, P2=10 ms, P3=15 ms)

2. How many page faults occur in the Optimum Page Replacement algorithm (OPR) with the following reference string for three-page frames?   

Reference String: 4,2,1,3,2,3,4,1

3. What is the average waiting time for Processes If the Operating System uses Shortest-Job-Remaining-First (SJRF) Scheduling Algorithm?

(P1=5 ms, P2=10 ms, P3=15 ms)

Arrival Time ( P1=0 ms, P2=5 ms, P3=10 ms)

Engineering   Computer-Science   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

1.

Answer:

Average Waiting Time = 6.667 ms

Full Solution:

2.

Answer:

No. of Page Faults = 5

Full Solution:

3.

Answer:

Average Waiting Time = 3.333 ms

Full Solution:

0 0
Know the answer?
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
Similar Questions
What is the average waiting time for Processes If the Operating System uses the Priority Scheduling...
What is the average waiting time for Processes If the Operating System uses the Priority Scheduling (PS) Scheduling Algorithm? (P1=20 ms, P2=15 ms, P3=10 ms, P4=5 ms) Priority Order: P1, P4, P3, P2
**Operating System** FCFS Example Processes arrived in the order of P2,P3,P1. Process Burst Time P1 24...
**Operating System** FCFS Example Processes arrived in the order of P2,P3,P1. Process Burst Time P1 24 P2 3 P3 3 Calculate the waiting times for P1, P2, and P3 Draw the Gantt Chart and calculate the average waiting time.
Problem 6 The following tables show the timing for processes using two different scheduling algorithms based...
Problem 6 The following tables show the timing for processes using two different scheduling algorithms based on the table of process arrival times and burst times (All ties were resolved using the arrival time). Using this information: Calculate the average turnaround time for each algorithm. Show your work. Name the scheduling algorithm used to generate the timing tables. Process Arrival Time Burst Time P1 0 4 P2 3.9 1 P3 2.9 3 P4 0.9 2 P5 1.9 4 Mystery Algorithm...
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is...
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is assigned a numerical priority,with a higher number indicating a higher relative priority. The scheduler will execute the highest-priority process. For processes with the same priority, a round-robin scheduler will be used with a time quantum of 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue. Process            Burst Time Arrival Time...
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is...
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is assigned a numerical priority,with a higher number indicating a higher relative priority. The scheduler will execute the highest-priority process. For processes with the same priority, a round-robin scheduler will be used with a time quantum of 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue. Process            Burst Time Arrival Time...
Process Burst Time Priority Arrival p1 8 15 0 p2 3 20 0 p3 4 20...
Process Burst Time Priority Arrival p1 8 15 0 p2 3 20 0 p3 4 20 20 p4 4 20 25 p5 5 5 45 p6 5 15 55 The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. The scheduler will execute the highest-priority process. For processes with the same priority, a round-robin scheduler will be used with a time...
A set of processes along with their burst time in milliseconds is given below. The processes...
A set of processes along with their burst time in milliseconds is given below. The processes should execute in First Come First Served order. Assume that the quantum (q) is 3: Process Burst Time P1 22 P2 4 P3 12 P4 15 P5 2 Find the average waiting time using the Round Robin algorithm. Round your answer to 2 decimal places
**Operating System** Preemptive SJF The newly arrived process with shorter CPU burst will preempt the currently...
**Operating System** Preemptive SJF The newly arrived process with shorter CPU burst will preempt the currently executing process. Process Arrival Time Burst Time P1 3 8 P2 2 4 P3 1 9 P4 0 5 Draw the Gantt Chart and calculate the average waiting time.
please post solutions using R Consider a batch manufacturing process in which a machine processes jobs...
please post solutions using R Consider a batch manufacturing process in which a machine processes jobs in batches of three units. The process starts only when there are three or more jobs in the buffer in front of the machine. Otherwise, the machine stays idle until the batch is completed. Assume that job interarrival times are uniformly distributed between 2 and 8 hours, and batch service times are uniformly distributed between 5 and 15 hours. Assuming the system is initially...
Suppose that the average waiting time for a patient at a physician's office is just over...
Suppose that the average waiting time for a patient at a physician's office is just over 29 minutes. In order to address the issue of long patient wait times, some physicians' offices are using wait-tracking systems to notify patients of expected wait times. Patients can adjust their arrival times based on this information and spend less time in waiting rooms. The following data show wait times (minutes) for a sample of patients at offices that do not have a wait-tracking...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT