The scheduling algorithm should be non-preemptive

The CPU utilization throughput should be at a maximum.

The response time should be at a minimum.

The waiting time, and response time should be at a maximum.

The waiting time should be at a minimum.

A process in the Terminated state is waiting to be scheduled

A process in the Waiting state is waiting for an event to occur

A process in the Running state cannot be interrupted

A process in the Ready state is waiting to be assigned to a processor

A process moves directly from New to Terminated state

Managing process scheduling to optimize CPU cycles.

Encrypting all memory contents for security.

Controlling peripheral device access for processes.

Deciding which processes (or parts thereof) and data to move into and out of memory.

Keeping track of which parts of memory are currently being used and by whom.

Not easy to debug

Difficult to implement

Scalability

Economical to create and context-switch threads

Not easy to write

Low priority handling

High memory usage

Starvation

Convoy effect

Complex implementation

Semaphores

Cache Coherence

Message Queue

Memory Space

File System

MS-DOS

iOS

Linux Ubuntu

Android OS

Windows Server 2016

Deciding which processes and data to move into and out of memory

Allocating and deallocating memory space as needed

Providing mechanisms for process communication

Suspending and resuming processes

Creating and deleting files and directories