The UNIX kernel will dynamically grow a process’s stack in virtual memory as needed, but it will never try to shrink it. Consider the case in which a program calls a C subroutine that allocates a local array on the stack that consumes 10 K. The kernel will expand the stack segment to accommodate it. When the subroutine returns, the stack pointer is adjusted and this space could be released by the kernel, but it is not released. Explain why it would be possible to shrink the stack at this point and why the UNIX kernel does not shrink it.
Answer to relevant QuestionsBriefly describe the three types of processor scheduling. Consider the following set of processes: Perform the same analysis as depicted in Table 9.5 and Figure 9.5 for this set. A processor is multiplexed at infinite speed among all processes present in a ready queue with no overhead. Show that for Poisson input from an infinite source with exponential service times, the mean response time Rx of a ...What is the difference between hard and soft real-time tasks? Maximum urgency first (MUF) is a real-time scheduling algorithm for periodic tasks. Each task is assigned an urgency that is defined as a combination of two fixed priorities and one dynamic priority. One of the fixed ...
Post your question