Process Management and Scheduling Overview

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/40

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

41 Terms

1
New cards

What is a process in computing?

An active instance of a program in execution.

2
New cards

What does a process include?

Its state, data, and interactions.

3
New cards

Is a process just the code of the program?

No, it is not just the code of the program.

4
New cards

Multiprogramming

Running multiple processes by rapidly switching the CPU between them.

5
New cards

Multiprocessing

Using multiple CPUs or CPU cores to run code simultaneously.

6
New cards

Multithreading

Running different parts of the same process concurrently on multiple CPUs.

7
New cards

Multitasking

A general term encompassing multiprogramming, multiprocessing, and multithreading.

8
New cards

Operating System (OS) Tasks

Managing processes, allocating resources, preventing deadlocks, supporting interprocess communication, and allowing users to create new processes.

9
New cards

What triggers process creation?

System initialization, execution of a process creation system call, a user request, or the initiation of a batch job.

10
New cards

What function is used to create a child process?

The fork() function.

11
New cards

What is process suspension?

It occurs when a process waits for I/O, data, or a signal from another process.

12
New cards

What can cause a process to suspend voluntarily?

A process can voluntarily pause itself.

13
New cards

What can cause a process to be forced to suspend?

A process can be forced to pause by the operating system.

14
New cards

Process Termination

Caused by normal exit, error exit, fatal errors, operator intervention, parent process request, or timeout.

15
New cards

Running for a process

The process is actively using the CPU.

16
New cards

Ready for a process

The process is runnable but currently stopped to allow another process to run.

17
New cards

Blocked for a process is

The process is unable to run until an external event occurs.

18
New cards

New for a process

The process has just been created but is not yet in the 'ready' pool.

19
New cards

Exit for a process

The process has been completed.

20
New cards

Process Control Block (PCB)

A data structure containing process ID, state, control, resource ownership, memory management, and accounting information.

21
New cards

Interrupts

Events that cause a change in the normal flow of a process's execution, often triggered by external devices needing CPU access.

22
New cards

What is a context switch?

The process of saving the current process's context when an interrupt occurs.

23
New cards

What happens during a context switch?

The CPU registers of the current process are saved.

24
New cards

What is executed after a context switch?

An interrupt handler.

25
New cards

What may occur after executing an interrupt handler?

Switching to a new process.

26
New cards

Threads

A stream of execution within a process, considered a lightweight process, that can share process memory and resources.

27
New cards

Thread Pooling

A set number of threads are created based on CPU cores, and tasks are assigned to run on available threads.

28
New cards

Inter-Process Communication (IPC)

Techniques for processes to communicate, exchange data, resolve resource conflicts, and manage dependencies.

29
New cards

What is process scheduling?

The OS decides which process will run next.

30
New cards

What are the two methods of process scheduling?

Pre-emptive scheduling via timer interrupts and cooperative scheduling when a process yields.

31
New cards

When is scheduling required in process management?

Scheduling is required on process exit or when a process blocks on I/O.

32
New cards

First-Come First-Served (FCFS)

Processes are added to a queue in the order they arrive. The process at the head of the queue runs until it blocks. The blocked process then joins the tail of the queue when ready.

33
New cards

Shortest Job First (SJF)

Processes are ordered by their run-time duration. The process with the shortest run time is executed first.

34
New cards

Round Robin (RR)

Each process is allocated a time slice (quantum). After its quantum, the process moves to the end of the queue.

35
New cards

An advantage and disadvantage of FCFS

FCFS is simple, but can lead to longer waiting and processing times for some processes.

36
New cards

What does SJF stand for in scheduling algorithms?

Shortest Job First

37
New cards

What is a key benefit of using SJF scheduling?

It minimizes wait time.

38
New cards

What is a potential drawback of SJF scheduling?

Long-running processes may 'starve'.

39
New cards

What does SJF require to function effectively?

It requires predicting the future duration of jobs.

40
New cards

benefit of RR

RR ensures fairness by equally distributing processing time.

41
New cards

Priority Scheduling benefit and drawback

Useful when priority is required but may cause low priority processes to starve.