Nonpreemptive kernels have a single active process at a time. Therefore, race situation scenarios are not possible in nonpreemptive kernels. If preemptive is properly designed to ensure that shared kernel data is devoid of race circumstances, it is race-free.
An illustration of a race condition is when a data structure updates a list of open files in a system when a new file is closed or opened. In this scenario, opening two files simultaneously would cause the list to receive two separate updates, which could lead to race situations.
<h3>
Difference between preemptive and nonpreemptive kernaals ?</h3>
It is a procedure that might be immediately changed. In comparison to non-preemptive kernels, it is more suited for real-time programming. Preemption is typically permitted, even in kernel mode. Responsive time is deterministic and is more responsive as compared to non-preemptive kernel.
It is a process that keeps running indefinitely until it has handled all execution handlers or willingly gives up the CPU. Compared to a preemptive kernel, it is less suited to real-time programming. Preemption of kernel mode processes is typically not allowed. In comparison to a preemptive kernel, response time is less responsive and nondeterministic.
To learn more about kernal data structure , visit
brainly.com/question/14235424
#SPJ4
