Test Two Review

These flashcards cover key vocabulary and definitions related to scheduling, resource management, and deadlocks as discussed in the lecture notes.

Multitasking

The objective of efficient management and execution of multiple processes at the same time.

Ready Q

A queue that holds all processes that are ready to run and waiting for CPU allocation.

Device Q

A queue that contains processes waiting for input/output operations to complete.

Blocked Process

A process that cannot proceed until certain conditions are met, typically waiting for I/O to complete.

Scheduler

A system component that decides which process to execute at any given time.

Long Term Scheduler

Responsible for determining which processes are admitted to the system for processing.

Short Term Scheduler

Determines which of the ready processes are to be executed next by the CPU.

Preemptive Scheduler

Allows a process to be interrupted and moved to the Ready Q by higher priority processes.

Non-Preemptive Scheduler

Allows a process to continue execution until it voluntarily yields control.

First In First Out (FIFO)

A non-preemptive scheduling algorithm where the first process in the queue is the first to be executed.

Shortest Job Next (SJN)

A non-preemptive scheduling algorithm that processes the job with the smallest execution time first.

Round Robin

A preemptive scheduling algorithm that assigns a fixed time slice or quantum to each process in the ready queue.

Average Wait Time

The average amount of time that processes spend waiting in the queue before execution.

Deadlock

A situation in a multi-tasking environment where processes cannot proceed because each is waiting for the other to release resources.

Resource Allocation Graph

A graphical representation that illustrates the allocation of resources to processes and can help detect deadlocks.

Deadlock Detection Algorithm

An algorithm that checks for deadlocks by analyzing resource allocation and process states.

Deadlock Recovery

Methods to resolve a deadlock once it is detected, typically involving process termination or resource preemption.

Deadlock Prevention

Strategies that prevent deadlocks by ensuring at least one of the necessary conditions for deadlock cannot hold.

Deadlock Avoidance

An approach that ensures resource requests do not lead to a deadlock by using algorithms that analyze potential states.