Operating System Lecture 6: Process Management & Scheduling

These flashcards cover key terminology and concepts from the lecture on process management and scheduling algorithms.

Process Management

The coordination of how processes are executed, scheduled, and managed in an operating system.

Scheduler

A component of the operating system that determines which processes run at a given time.

First Come First Serve (FCFS)

A non-pre-emptive scheduling algorithm that processes jobs in the order they arrive.

Shortest Job Next (SJN)

A non-pre-emptive scheduling algorithm that selects jobs based on the length of the CPU cycle time.

Priority Scheduling

A scheduling algorithm that gives preferential treatment to higher priority jobs.

Shortest Remaining Time (SRT)

A pre-emptive version of SJN that assigns the job closest to completion.

Round Robin

A pre-emptive scheduling algorithm that allocates a fixed time slice for each job.

Time Quantum

The fixed amount of time assigned to process execution in Round Robin scheduling.

Job Scheduler

A high-level scheduler that initiates jobs based on certain criteria.

Process Scheduler

A low-level scheduler that determines which jobs will access the CPU at any time.

Pre-emptive Scheduling

An approach that allows a process to interrupt and switch to another job based on priority.

Non-Pre-emptive Scheduling

An approach where a job runs to completion before another job can start, usually interrupted only by an I/O request.

Turnaround Time

The total time taken to complete a job from submission to completion.

Interrupt Handler

Software that manages interrupts that occur during processor operation.