Operating Systems: CPU Scheduling Concepts

True (A)

False (B)

The process scheduler selects the next process to be executed on the CPU.

<p>Time quantum (A), Time slice (D)</p> Signup and view all the answers

<p>A small time quantum leads to high context switch overhead, impacting overall system performance.</p> Signup and view all the answers

<p>False (B)</p> Signup and view all the answers

<p>First-Come, First-Served (FCFS) = Processes are executed in the order they arrive. Shortest-Job-First (SJF) = The process with the shortest burst time is executed first. Shortest-Remaining-Time-First (SRT) = A preemptive version of SJF, where the process with the shortest remaining burst time is selected for execution. Round Robin (RR) = Each process gets a fixed amount of CPU time, and then it's moved to the end of the ready queue. Priority Scheduling = Processes are assigned priorities, and the process with the highest priority gets the CPU. Multilevel Queue Scheduling = The ready queue is divided into multiple queues, each with its own priority and scheduling algorithm. Multilevel Feedback Queue Scheduling = Processes can move between different queues based on their CPU usage patterns and priorities.</p> Signup and view all the answers

<p>False (B)</p> Signup and view all the answers

<p>Starvation, where low priority processes might never get a chance to execute.</p> Signup and view all the answers

<p>Aging is a solution to Starvation where the priority of a process is gradually increased over time.</p> Signup and view all the answers

<p>True (A)</p> Signup and view all the answers

A fundamental operating system function that manages access to the CPU.

The process of selecting a process from the ready queue to execute on the CPU.

A set of all processes residing in main memory, ready and waiting to execute.

A set of processes waiting for an event, such as I/O completion.

A period of time where a process executes on the CPU.

A period of time where a process is waiting for an I/O operation to complete.

The process of moving a process from one state to another, such as from the running state to the ready state.

A process that has many short CPU bursts, and therefore spends most of its time waiting for I/O operations.

A process that has a few long CPU bursts, and therefore spends most of its time executing on the CPU.

The module that gives control of the CPU to the process selected by the CPU scheduler.

The time required for the dispatcher to stop one process and start another running.

A nonpreemptive scheduling algorithm that selects processes for execution in the order they arrive.

A nonpreemptive scheduling algorithm that selects the process with the shortest next CPU burst to execute next.

A preemptive scheduling algorithm that selects the process with the shortest remaining CPU burst to execute next.

A preemptive scheduling algorithm that gives each process a small unit of time called a time quantum or time slice.

The amount of time each process is allocated before being preempted in round-robin scheduling.

A scheduling algorithm that assigns a priority to each process and selects the process with the highest priority to execute.

A situation where a low-priority process may never get to execute.

A technique used in priority scheduling to increase the priority of a process over time, to prevent starvation.

A scheduling algorithm that uses multiple ready queues, each with a different priority.

A scheduling algorithm that allows processes to move between queues based on their behavior.

A process that has many short CPU bursts, indicating it requires frequent access to I/O resources.

A process that has a few long CPU bursts, suggesting it performs computationally intensive tasks.

A scheduling algorithm that assigns a priority to each process and selects the process with the highest priority, allowing for preemption.

A scheduling algorithm that assigns a priority to each process and selects the process with the highest priority, without preemption.

A scheduling algorithm that assigns a priority to each process and selects the process with the highest priority, with equal priority processes being scheduled in a round robin fashion.

A scheduling algorithm where processes are grouped into different queues based on their characteristics, such as interactive or batch processes.

A scheduling algorithm where the CPU scheduler prioritizes CPU-bound processes and I/O-bound processes are assigned lower priority.

A scheduling algorithm that dynamically adjusts priorities of processes based on their behavior, promoting those that require more CPU time and demoting those that have been idle for extended periods.

A common scheduling algorithm where the CPU scheduler allows processes to acquire resources automatically.

A scheduling algorithm where the CPU scheduler assigns specific resources (such as memory, I/O devices) to each process.