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 10K. 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.

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 10K. 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.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Suppose that we are asked to run the program and when our program reaches to line 23, we are also asked to take a snapshot of our program's run-time stack. So, please draw full ARIS of the all subprograms which are placed in the stack at line 23. def sub1(): def sub2(isEverythingOk): def sub3(): print("in sub3") 1st = [1, 2, 3, 4, 5, 6, 7] for x, res in enumerate(lst): print (x,":",res) %3D sub2(false) print("end of sub3") 10 11 12- 13 14 - print("in sub2") if (isEverythingOk): sub3() else: 15 sub4() 16 print("end of sub2") 17 18 - def sub4(): | 19 - 20 21 22 23 24 25 26 27 28 29 def sub5(): print("in sub5") secondLst = [10, 50, 12, 45, 66, 73, 29] res = list(map(lambda x:x, secondLst)) print(res) # POSITION print("end of sub5") print("in sub4") sub5() print("end of sub4") print("in sub1") sub2(true) 30 31 32 print("end of sub1") N m 4 n6 7 00
In an assembly language program, local variables are kept in a stack. True or false: this assertion
please solve with python.
In an assembly language program, local variables are kept in a stack. True or false: this assertion
To solve the problem of mismatch between the speeds of computer and printer, we usually use a buffer. Computer writes data to the buffer, and then printers get data from buffer. Which data structure could be used to implement the buffer? (A) Stack (B) Queue
Write a C program that takes a list of command line arguments, each of which is the full path of a command (such as /bin/ls, /bin/ps, /bin/date, /bin/who, /bin/uname etc). Assume the number of such commands is N, your program would then create N direct child processes (ie, the parent of these child processes is the same original process), each of which executing one of the N commands. You should make sure that these N commands are executed concurrently, not sequentially one after the other. The parent process should be waiting for each child process to terminate. When a child process terminates, the parent process should print one line on the standard output stating that the relevant command has completed successfully or not successfully (such as "Command /bin/who has completed successfully", or "Command /bin/who has not completed successfully"). Once all of its child processes have terminated, the parent process should print "All done, bye-bye!" before it itself terminates. Note: do…
Write a Java program using Stack class to demonstrate the following activities: Create three empty stacks named stack1, stack2 and stack3 respectively. Push the numbers [6,4,9] into stack1 and [1,2,3] into stack2. Pop the top number of stack1 and top number of stack2 and multiply them. Then, push the multiplication result into stack3. Pop the top number of stack1 and top number of stack2 and divide them. Push the result of division into stack3. Print Stack1, stack2 and stack3. Print the largest number in stack3
Open the DS Project in your desktop (folder DS2), then in the main function Write code (user level) to do the following: . Read 5 characters from the user. . Put these characters in a stack. • Traverse the stack and put only its vowel characters (a, e, i, o, u) in a queue. Sample Input: abcde Result: • Stack will have: a b c d e (then will be empty) • Queue will have: e a
I need the answer as soon as possible
Create a code that stores values on the stack in each iteration of the factorial label. How many values are you storing on the stack in each iteration of your factorial label? By how many bytes do you expect the stack pointer to change? using coding composer studio with a MSP432 microcontroller. In assembly language not C or C++.
Write an Arm Assembly Program that does the following:•Stores on the stack a list of words of memory where the first element of the list is how manyremaining elements are in the list, and the rest of the elements in the list are initialized tosome random values.– Example:list: 6, -3, 4, 5, 9, 22, 99//stores a list of the 6 elements -3, 4, 5, 9, 22, 99•At the end of the program, register r0 should hold the sum of only the negative values in thearray (nonnegative elements are ignored).•Note that your program must work correctly even if the values stored in the list are changed.
In an assembly language program, local variables are kept in a stack.True or false: this assertion