OS Prefi

Waiting Time

The sum of the personnel spent waiting in the ready queue.

Simple Paging

A technique that divides the memory into several equal-sized frames.

Job Queue

The queue that contains all the processes in the system.

Shortest Remaining Time First

An algorithm where the process with the smallest execution time is selected for the next execution.

Execution Time

The time required for a process to be executed by the control processing unit.

Medium Term Scheduler

The scheduler that handles swapped-out processes in scheduling.

Virtual Memory Paging

A partitioning method that processes similarly to simple segmentation but has no internal fragmentation.

Round Robin

An algorithm that generates a clock interrupt at periodic intervals.

Physical Addresses

Addresses generated by the loader when a program is loaded into main memory.

Swapping

Also known as memory compaction.

Throughput

A criterion that measures how much work is performed by the processor.

Best-Fit

A placement algorithm that chooses the block closest to the requested size in partitioning.

Simple Segmentation

A technique that divides each process into several segments.

Virtual Memory

Provides processes and a kernel with a private view of main memory.

True about long term Scheduling

It is also known as the job scheduler.

Not a requirement: Memory Management Requirement

The act of selecting a task or job to be dispatched.

Shortest Remaining Time First Best Description

It is the estimated processing time to perform the selection function.

Not considered a characteristic: Virtual Memory Characteristic

It provides fast access at a relatively high cost.

Turnaround Time

The difference between the finish time and the arrival time.

Fairness in Scheduling

Means processes should be treated the same.

Not considered a criterion: Scheduling Criterion

Not considered a criterion: The average rate of placement algorithm.

Response Time

The time from submitting a request until the response is received.

Not TRUE: Memory Management Statement

It holds data that is in use.

Not TRUE: Virtual Memory Segmentation Statement

It is similar to simple paging.

TRUE: Dynamic Partitioning Statement

It has no internal fragmentation.

TRUE: Fixed Partitioning Statement

It only produces minimal operating system overhead.

TRUE: Simple Paging Statement

It may cause a small amount of internal fragmentation.

Shortest Job First Best Description

It is the best approach to minimize the waiting time.

Not TRUE: Process Scheduling Statement

It divides CPU time among active processes and threads.