Question

Describe how the Priority Scheduling algorithm works. Explain the differences of working procedure between preemptive and...

Describe how the Priority Scheduling algorithm works. Explain the differences of working procedure between preemptive and non-preemptive version of this algorithm.

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

Homework Answers

Answer #1

Please upvote if you are able to understand this and if there is any query do mention it in thr comment section.

The algorithm of priority scheduling is to schedule the process according to their priority. What happens in this algorithm is from all the available processes, the process which have the higher priority to complete a task are executed first and then the process with lower priority are executed. But if there is condition that any processes have same priority then their execution is determined on the basis of First Come First Serve(FCFS) algorithm.

Following are the differences between the preemptive version of this algorithm and non-preemptive version of this algorithm:

When are processes are executed in the preemptive version of this algorithm then during their execution if any other process with higher priority will come then the execution of the processes will be interrupted in between whereas if the processes are getting executed in the non-preemptive version of this algorithm then the execution of the processes will not be interrupted in between due to the presence of the process with higher priority.

The process in the preemptive version of this algorithm can be switched from ready state to running state whereas in the non-preemptive version of this algorithm the process does not switch any process from running state to ready state.

If this was supposed to be done in any other way then please mention it in the comment section otherwise please upvote.

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
In a few words, explain how a preemptive scheduling policy differs from a non-preemptive scheduling policy.
In a few words, explain how a preemptive scheduling policy differs from a non-preemptive scheduling policy.
Briefly explain what aging is, and why it is important in a Priority Scheduling scheduling algorithm.
Briefly explain what aging is, and why it is important in a Priority Scheduling scheduling algorithm.
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Process Priority Burst...
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Process Priority Burst Arrival P 1 8 15 0 P 2 3 20 0 P 3 4 20 20 P 4 4 20 25 P 5 5 545 P 6 5 15 55 Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. The scheduler will execute the highestpriority process. For processes with the same priority, a round-robin scheduler will be...
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...
Chose a homeostatic system and describe how it works. Be sure to explain how negative feedback...
Chose a homeostatic system and describe how it works. Be sure to explain how negative feedback is needed for the system to work. What would happen if the negative feedback loop were not working properly?
In your own words describe how they are similar(compare) and also explain the differences(contrast) between the...
In your own words describe how they are similar(compare) and also explain the differences(contrast) between the defs. of recreations, leisures, and plays. Must be a complete paragraph.    Note:: defs. = definitions 1. describe each defs. 2. What do the defs.have in common 3. Finally, explain How are the defs. different.
Describe how RNAi works, and explain how RNAi is involved in post transcriptional regulation.
Describe how RNAi works, and explain how RNAi is involved in post transcriptional regulation.
1. Describe how Sex-linked inheritance works 2.Explain how linked genes are inherited
1. Describe how Sex-linked inheritance works 2.Explain how linked genes are inherited
2. Define M1 and M2 3. Describe the money multiplier and explain how it works.
2. Define M1 and M2 3. Describe the money multiplier and explain how it works.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT