Progress requires the decision about the next entrant to involve only processes that currently wish to enter.
The selection cannot be postponed forever when the critical section is available.
Correct Answer: D. Dividing processors into sets assigned to particular workloads or classes
Explanation:
Processor partitioning reserves groups of CPUs for selected applications, users, or service classes.
It can provide isolation, predictability, or performance control.
Correct Answer: A. A code region that accesses shared data or resources and must not be executed concurrently by conflicting threads
Explanation:
A critical section contains operations whose interleaving could corrupt shared state.
Synchronization ensures that incompatible executions do not overlap.
The entry section contains the synchronization steps used to acquire access to the critical section.
Only after successful entry may the process execute the protected code.
Correct Answer: D. Each processor participates in scheduling and can run kernel and user tasks
Explanation:
In symmetric multiprocessing, processors are peers that can schedule work from shared or per-CPU queues.
This improves flexibility but requires coordination over shared scheduling data.
Correct Answer: A. To distribute runnable work so processors are used effectively
Explanation:
Load balancing moves or assigns tasks so no processor is overloaded while another remains underused.
The policy must also consider migration cost and cache locality.
Push migration actively transfers work away from an overloaded processor.
The balancing mechanism initiates the movement rather than waiting for an idle CPU to request work.
Correct Answer: D. The scheduler tries to keep a task on the same processor but may migrate it
Explanation:
Soft affinity is a scheduling preference rather than an unbreakable restriction.
The scheduler may move the task when load balancing or other needs outweigh locality.
Hard affinity defines an explicit CPU set on which the thread is permitted to run.
The scheduler must respect that restriction when making placement decisions.
Correct Answer: B. Memory access time depends on which processor node owns the memory
Explanation:
Non-uniform memory access systems have faster local memory and slower remote memory.
Placing a thread near its data can reduce memory latency and interconnect traffic.