Synchronization

A __________ exists when access to shared data is not controlled, potentially resulting in __________ data values.

race condition, corrupt

A __________ process is one that can affect or be affected by other processes executing in the system.

cooperating

A __________ section is a segment of code where a process may access and update shared data, and no two processes should be executing it at the same time.

critical

The three conditions that must be met for a solution to the critical-section problem are __________, __________, and __________.

mutual exclusion, progress, bounded waiting

The __________ operation of a semaphore decreases its value, and the __________ operation increases its value.

wait, signal

A __________ semaphore can only have values of 0 and 1, while a __________ semaphore can take unrestricted non-negative values.

binary, counting

The __________ problem occurs when multiple threads access and manipulate the same data concurrently, and the final result depends on the execution order.

race condition

A __________ kernel allows a process to be preempted while running in kernel mode, while a __________ kernel does not.

preemptive, nonpreemptive

In Peterson’s solution, the two shared variables used for synchronization are __________ and __________.

turn, flag

The __________ instruction atomically modifies a memory location and is commonly used in synchronization.

test_and_set

The __________ and __________ operations are the two fundamental operations used in implementing semaphores.

wait, signal

The mutual exclusion requirement states that if process Pi is executing in its __________ section, then no other process can be executing in their __________ sections.

critical, critical

The two general approaches used to handle critical sections in operating systems are __________ kernels and __________ kernels.

preemptive, nonpreemptive

A __________ is a data structure that maintains a list of processes waiting to enter a critical section.

waiting queue

The __________ problem arises when a low-priority process holds a resource needed by a high-priority process.

priority inversion

A __________ ensures that all load and store operations are completed before additional load and store operations occur.

memory barrier

A __________ lock is a mutual exclusion mechanism that uses busy waiting.

spin

The __________ operation suspends a process when it cannot proceed due to resource unavailability.

sleep

The __________ operation resumes execution of a suspended process.

wakeup

A system with multiple processors executing threads in parallel is known as a __________ system.

multiprocessor

A __________ process can directly share a logical address space with other processes.

cooperating

The __________ section of a process requests permission to enter the critical section.

entry

The __________ section of a process executes after exiting the critical section.

remainder

__________ is the requirement that a process should not wait indefinitely to enter its critical section.

bounded waiting

The __________ model determines how memory modifications by one processor are visible to others.

memory

The __________ problem is solved by ensuring that only one process can access shared data at a time.

critical-section

__________ synchronization tools provide higher-level methods for process coordination.

software-based

A process executes the __________ operation on a semaphore to decrement its value before proceeding.

wait

A process executes the __________ operation on a semaphore to increment its value and wake up a waiting process.

signal

The __________ of a process refers to its position in the system’s scheduling order.

priority

The __________ algorithm is a software-based solution to the critical-section problem for two processes.

Peterson’s

The __________ problem can be prevented by ensuring that processes take turns entering their critical sections.

race condition

The __________ variable is used in Peterson’s solution to determine which process enters the critical section first.

turn

The __________ instruction is an atomic operation that swaps the contents of two memory locations.

compare_and_swap

The __________ scheduling method selects the next process based on priority.

priority-based

The __________ data structure is used by semaphores to keep track of waiting processes.

queue

A __________ lock is a simple software tool used for mutual exclusion.

mutex

The __________ technique allows waiting processes to be placed in a queue rather than using busy waiting.

blocking

The __________ function is used to acquire a mutex lock before entering the critical section.

acquire

The __________ function is used to release a mutex lock after exiting the critical section.

release

The __________ operation ensures that a thread’s access to a shared resource does not interfere with others.

synchronization

A __________ system must be carefully designed to avoid deadlocks and ensure fair process execution.

concurrent

The __________ technique prevents busy waiting by putting waiting processes to sleep.

blocking

The __________ section contains code that is executed when a process finishes using a shared resource.

exit

The __________ section of a process follows the critical section and performs clean-up operations.

exit

The __________ technique avoids starvation by ensuring each process gets a turn to execute.

fair scheduling

The __________ method ensures that higher-priority processes are not indefinitely delayed by lower-priority processes.

priority inheritance

A __________ is a data structure used to store and manage a list of active processes.

process table

The __________ method of synchronization ensures that no process is starved of resources.

fair scheduling

The __________ is a high-level synchronization tool used to avoid timing errors in concurrent programming.

monitor