As described in Sec. 11.4, there is a special handle table used to allocate IDs for processes
Question:
As described in Sec. 11.4, there is a special handle table used to allocate IDs for processes and threads. The algorithms for handle tables normally allocate the first available handle (maintaining the free list in LIFO order). In recent releases of Windows this was changed so that the ID table always keeps the free list in FIFO order. What is the problem that the LIFO ordering potentially causes for allocating process IDs, and why does not UNIX have this problem?
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Answer rating: 50% (8 reviews)
Because the IDs are reused right away a program that identified a process that it wanted ...View the full answer
Answered By
Kamal Joshi
Teaching should be done with passion. If the students are happy at the end of the day, so am I. If not happy, I must have missed something. I need to work harder to make them happy.
I have been a teaching in a institute of Computer Science (Programming and Database) for several decades and taught at the undergraduate and graduate level.
While teaching, I am more a mentor and organizer of learning experiences and situations, such that my students actively understand, reinvent and reconstruct everything they learn, than a simple transmitter of ready made and established truths imposed on them from outside. In other words, I avoid indoctrination and brainwashing. This means that I make use of the active methods, not the traditional or conservative ones, and appeal to due technology when it is appropriate.