Question
Question 31 (1 point) Suppose a memory management module is aided with TLB. Assuming that a program has just referenced a logical address. When can
Question 31 (1 point)
Suppose a memory management module is aided with TLB. Assuming that a program has just referenced a logical address. When can a TLB miss with no page fault occur?
Question 31 options:
|
This never happens.
|
|
This is the usual case and always happen in demand paging.
|
|
If the page is in main memory but the reference is not on page table.
|
|
If the page is not in main memory.
|
Question 32 (1 point)
An OS provides each process with 65536 bytes of address space divided into pages of 1024 bytes each. A particular program has a text size of 32768 bytes, a data size of 16386 bytes, and a stack size of 15870 bytes. Each memory page must contain either text, data, or stack, but not a mix of two or three of them. The allocated memory space of 65536 bytes is sufficient to fit the program on memory.
Question 32 options:
True | |
False |
Question 33 (1 point)
Every host in a distributed system has __________
Question 33 options:
|
A different OS
|
|
A file system
|
|
A network connection
|
|
I/O devices
|
Question 34 (1 point)
A(n) ___________ occurs when multiple processes or threads read and write data items so that the final result depends on the order of execution of instructions in the multiple processes.
Question 34 options:
|
atomic operation
|
|
deadlock
|
|
mutual exclusion
|
|
race condition
|
Question 35 (3 points)
Consider the following proposed solution to critical section problem between two processes P0 and P1. The 'turn' variable, shared between P0 and P1, is initialized with 0 (or, 1) and can be updated atomically.
Process P0 | Process P1 |
while(TRUE){ /* some code */ while (turn != 0); update_shared_resource(); turn = 1; /* other code */ } | while(TRUE){ /* some code */ while (turn != 1); update_shared_resource(); turn = 0; /* other code */ } |
Is this solution an acceptable (correct) for critical section problem? Explain.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started