CMPE 180C Operating Systems Midterm - Process Management Vocabulary

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/56

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering core operating systems concepts from CMPE 180C process-management notes.

Last updated 3:31 AM on 9/21/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

57 Terms

1
New cards

Program

A passive executable file containing instructions and stored on disk.

2
New cards

Process

An active instance of a program currently executing.

3
New cards

Text Section

The section of a process containing the program's compiled executable instructions.

4
New cards

Data Section

The section of a process containing global and static variables.

5
New cards

Heap

Memory dynamically allocated during execution, such as memory requested by malloc().

6
New cards

Stack

Memory section containing function parameters, return addresses, and local variables.

7
New cards

PID

A process identifier used by the operating system to identify a process.

8
New cards

New State

The process state indicating that the operating system is creating the process.

9
New cards

Ready State

The process state indicating that the process can run but is waiting to receive CPU time.

10
New cards

Running State

The process state indicating that the CPU is currently executing the process's instructions.

11
New cards

Waiting State

The process state indicating that the process cannot continue until an event occurs, such as I/O completion.

12
New cards

Terminated State

The process state indicating that the process has finished executing.

13
New cards

Process Control Block (PCB)

The operating system's record containing the information needed to manage a process, including PID, process state, program counter, CPU registers, scheduling data, memory information, and I/O information.

14
New cards

Program Counter

A component in the PCB storing the address of the next instruction the process should execute.

15
New cards

Job Queue

The collection of all processes in the system.

16
New cards

Ready Queue

Processes in memory that are ready and waiting to use the CPU.

17
New cards

Device Queue

Processes waiting for a particular I/O device or operation.

18
New cards

Short-Term Scheduler

Selects the next ready process to receive the CPU. It must be fast because the OS invokes it very frequently.

19
New cards

Long-Term Scheduler

Selects which processes enter the ready queue and controls the degree of multiprogramming.

20
New cards

Degree of Multiprogramming

The number of processes loaded into memory and available for execution.

21
New cards

CPU-Bound Process

A process that spends most of its time performing computations and has long CPU bursts.

22
New cards

I/O-Bound Process

A process that frequently waits for I/O and generally has short CPU bursts.

23
New cards

Context Switch

Saving the state of one process and restoring the saved state of another.

24
New cards

Parent Process

A process that creates another process.

25
New cards

Child Process

A process created by another process.

26
New cards

Process Tree

A hierarchical representation of parent and child process relationships.

27
New cards

fork()

A system function that creates a child process by duplicating the calling process.

28
New cards

Sequential Unconditional Forks Formula

For nn unconditional sequential forks, the total process count formula is 2n2^n, creating 2n−12^n - 1 new children.

29
New cards

exec()

A function that replaces the calling process's program image with a new program without creating another process.

30
New cards

execvp()

An exec variant where 'v' means arguments are passed as a vector (array of string pointers) and 'p' means it searches for the executable using directories in the PATH environment variable.

31
New cards

exit()

A function that ends the calling process and supplies an exit status.

32
New cards

wait()

A function that blocks the parent until one of its children terminates.

33
New cards

waitpid()

A function that waits for a child selected by its PID or by another PID rule.

34
New cards

Zombie Process

A terminated child whose parent has not collected its exit status.

35
New cards

Orphan Process

A child whose parent terminated before the child.

36
New cards

User Mode

A restricted CPU mode used for ordinary application code.

37
New cards

Kernel Mode

A privileged CPU mode used by the operating system.

38
New cards

Privileged Instruction

An instruction that may execute only in kernel mode.

39
New cards

System Call

A controlled request from a program for a service provided by the operating system.

40
New cards

API

A programming interface that provides convenient functions for accessing services.

41
New cards

Trap (or Exception)

A software-generated transfer to the operating system caused by an error or service request.

42
New cards

Environment Variable

A named value inherited by processes that describes aspects of their execution environment.

43
New cards

PATH

An environment variable listing directories searched for executable programs.

44
New cards

IPC (Interprocess Communication)

Mechanisms that allow processes to exchange data and coordinate.

45
New cards

Shared-Memory IPC

An IPC model where processes access a shared region of memory, generally requiring explicit synchronization.

46
New cards

Message-Passing IPC

An IPC model where processes exchange messages using operations such as send() and receive().

47
New cards

Direct Communication

Message passing where processes explicitly name each other when sending and receiving messages.

48
New cards

Indirect Communication

Message passing where processes exchange messages through a shared mailbox or port.

49
New cards

Synchronous Communication

Communication involving blocking behavior where the calling process waits until the operation can complete.

50
New cards

Asynchronous Communication

Communication involving nonblocking behavior where the calling process continues without waiting.

51
New cards

Rendezvous

Communication in which both send and receive block until they meet.

52
New cards

Zero-Capacity Buffering

A message queue setup where no messages wait in a queue, forcing the sender to synchronize with the receiver.

53
New cards

Bounded-Capacity Buffering

A finite message queue where the sender waits when the queue is full.

54
New cards

Unbounded-Capacity Buffering

A theoretically unlimited message queue where the sender does not wait because of capacity.

55
New cards

Pipe

A communication channel that allows processes to exchange data.

56
New cards

Ordinary Pipe

A normally unidirectional pipe commonly used between related processes such as a parent and child.

57
New cards

Named Pipe

A pipe that can support communication between processes without requiring a parent-child relationship.