Question

Can starvation occur in a non-preemptive scheduling system? Can it occur in a preemptive one?

Can starvation occur in a non-preemptive scheduling system? Can it occur in a preemptive one?

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

Homework Answers

Answer #1

No, starvation cannot occur in non-preemptive scheduling systems because processes in this system will all keep running until the end, and no process can be added in between.

Yes, pre-emptive scheduling may cause starvation. Preemptive scheduling basically means process switch from running state to ready state or waiting state to ready state. Starvation may be caused due to the insertion of continuos high priority process in the queue. In this scenario, the low priority processes may end up starving.

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.
operating systems There are preemptive and non-preemptive approaches to handle critical section in operating system. As...
operating systems There are preemptive and non-preemptive approaches to handle critical section in operating system. As non-preemptive approaches doesn’t face problem of race conditions, explain in detail why we still use preemptive approaches to handle critical section.
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.
Urgent please: A CPU scheduler can be either preemptive or non-preemptive. What does it mean to...
Urgent please: A CPU scheduler can be either preemptive or non-preemptive. What does it mean to say it is “preemptive”?
Which ONE of the following statements about the processes that occur during starvation is FALSE? Choose...
Which ONE of the following statements about the processes that occur during starvation is FALSE? Choose the best answer During starvation, the liver exhausts its glycogen stores within the first day. During starvation, the liver increases its capacity for gluconeogenesis. After depletion of liver glycogen, fatty acids become the primary source of gluconeogenic precursors used for glucose synthesis. Increased reliance on ketone bodies for fuel reduces the breakdown of proteins and spares the remaining glucose for use by the brain....
What is a major problem when using priority scheduling algorithms? starvation resource utilization aging memory leaks
What is a major problem when using priority scheduling algorithms? starvation resource utilization aging memory leaks
1- In process creation, what are the possibilities in concerned (1) Parent execution (2) Address space...
1- In process creation, what are the possibilities in concerned (1) Parent execution (2) Address space of the new process (child)? 2- A parent may terminate the execution of one of its children. What are the reasons? 3- What are the CPU scheduling algorithm criteria? 4- What are the events occur when the process allocate to the CPU and is executing? 5- What are the differences between: (1) Long-term scheduler and short-term scheduler? (2) Preemptive and non-preemptive scheduling? (3) CPU-bound...
Using the non-preemptive and preemptive Priority schedulers, draw out process execution timelines for the following processes....
Using the non-preemptive and preemptive Priority schedulers, draw out process execution timelines for the following processes. Clearly indicate the wait time for each process for each scheduler.   Process Arrival Burst Priority P1 0 6 2 P2 3 2 1 P3 6 8 4 P4 9 4 5 P5 12 3 3
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...
Compare Earliest-Deadline First (EDF) scheduling against Rate-Monotonic (RM) scheduling. Now, consider an overloaded system, i.e., the...
Compare Earliest-Deadline First (EDF) scheduling against Rate-Monotonic (RM) scheduling. Now, consider an overloaded system, i.e., the total CPU utilization of all tasks is higher than 100%. In your opinion, between EDF and RM, which one is better, and from what perspective?
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT