• edited by
195 views
3 3 votes

Which of the following statements are FALSE about threading?

  1. Threads share an address space with other threads in the same process.
  2. Threads share register state and stack in the same process.
  3. The kernel can only create threads equal to the number of processors in the system.
  4. Switching between threads of a process requires flushing of TLB.

1 Answer

2 2 votes
A: True; processes share their address space.

B: False; process does not share register state and stack to run independently.

C: False; kernel can create any number of threads regardless of number of processors in the system, the point is it can run threads equal to the number of processors simultaneously.

D: False; within a process TLB flush is not required, switching between processes requires flushing although TLB can have ASIDs(address space identifiers) that prevent accessing other process address space hence providing security.
Answer:
Position:
Show:

Related questions

2 2 votes
1 1 answer
505
505 views
GO Classes asked Sep 15, 2025
505 views
Void main() { int a = 0; for (int i = 0; i < 4; i++) { if (fork() == 0) { a++; return ; } else { a++; ...
2 2 votes
2 2 answers
213
213 views
GO Classes asked Sep 15, 2025
213 views
A system is composed of four processes, $\{\mathrm{P} 1, \mathrm{P} 2, \mathrm{P} 3, \mathrm{P} 4\}$, and two types of consumable resources, $\{\mathrm{R} 1, \mathrm{R} 2...
2 2 votes
1 1 answer
288
288 views
GO Classes asked Sep 15, 2025
288 views
Which of the following problems are associated with spin locks?DeadlockStarvation due to lack of fairnessPriority inversion cannot occurContext-switch overhead is elimina...
0 0 votes
1 1 answer
218
218 views
GO Classes asked Sep 15, 2025
218 views
A computer system has N bytes of physical memory and M bytes of virtual address space. The page table(single-level) of a process contains Q entries, and each page-table e...