Describe two kernel data structures in which race conditions are possible
Answers
do not know the answer sorry
Threads, or commonly known as lightweight processes are the basic fundamental unit for initialization of CPU.
So, they should not be called lightweight processes?
One of the reason is that the threads take much lesser time as compared to other processes, which results from the fact that all the threads share the same address space, so there is no need to switch the address space.
Kernel Threads:
They are same as other space threads in many aspects, but one of the biggest difference is that they only exist in the kernel space and execute in an advantageous process and can access to the kernel data structures.
These are basically applied to implement background tasks and operations in the kernel environment.
The task can take care of asynchronous events or future event.