Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Operating System - Midterms > Lesson 3: Process Management > Flashcards

Lesson 3: Process Management Flashcards

1
Q

unit of work in most systems

A

Process

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

program in execution; process execution must progress in sequential fashion

A

Process

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

set of associated resources

A

Process

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Examples of Processes

A

Compiler
Word processor
Email program
Sending output to a printer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

T or F: Although 2 processes may be associated with the same program, they are considered 2 separate execution sequences.

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What does a process include? (PSDT)

A

Program counter
Stack
Data Section
Text Section

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

[What does a process include] specifies the next instruction to be executed

A

Program counter

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

[What does a process include] contains temporary data

A

Stack

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

[What does a process include] contains global variables

A

Data section

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

[What does a process include] program code

A

Text section

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Representation of a process in the operating system

A

PCB

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What does PCB stand for?

A

Process Control Block

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

[PCB] Different states as a process executes (NRRWT)

A

New
Ready
Running
Waiting
Terminated

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

[Process State] the process is being created

A

New

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

[Process State] The process is waiting to be assigned to a processor

A

Ready

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

[Process State] Instructions are being executed

A

Running

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

[Process State] The process is waiting for some event to occur

A

Waiting

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

[Process State] The process has finished execution

A

Terminated

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

[PCB] contains the memory address of the next instruction to be executed for this process

A

Program counter

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

[PCB] CPU registers include: (ASIG)

A

Accumulators
Stack Pointers
Index Registers
General Purpose Registers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

[PCB] Memory-management information includes: (VPS)

A

Value of base and limit registers
Page tables
Segment tables

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

[PCB] I/O Status information includes

A

list of I/O devices allocated to this process, list of open files, etc.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

[PCB] CPU scheduling information includes: (PPS)

A

Process priority
Pointers to scheduling queues
Scheduling Parameters

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

[PCB] Accounting information includes (RLAJ)

A

Amount of CPU and REAL TIME used
Time LIMITS
Account numbers
Job or process number, etc.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

Process Scheduling Queues (JRD /jared/)

A

Job queue
Ready queue
Device queues

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
26
Q

[Process Scheduling Queues] set of all processes in the system

A

Job queue

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
27
Q

[Process Scheduling Queues] set of all processes residing in main memory, ready and waiting to execute

A

Ready queue

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
28
Q

[Process Scheduling Queues] set of processes waiting for an I/O device

A

Device queues

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
29
Q

Schedulers (LS)

A

Long-term scheduler (job scheduler)
Short-term scheduler (CPU scheduler)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
30
Q

[Schedulers]
—selects which processes should be brought into the ready queue
—invoked very infrequently
—controls the degree of multiprogramming

A

Long-term scheduler (job scheduler)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
31
Q

[Schedulers]
—selects which process should be executed next and allocates CPU.
—invoked very frequently

A

Short-term scheduler

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
32
Q

Processes can be described as either: (IC)

A

I/O-bound process
CPU-bound process

33
Q

[Bound Processes] spends more time doing I/O than computations, many short CPU bursts

A

I/O-bound process

34
Q

[Bound Processes] spends more time doing computations; few very long CPU bursts

A

CPU-bound processes

35
Q

[Schedulers]
—an intermediate level queue used in systems with virtual memory or timesharing
—removes processes from the memory and reintroduced later (swapping)
—reduces the degree of multi programming

A

Medium term

36
Q

[Process States, New] 4 principal events for process creation (SERI)

A

System initialization
Execution of a process creation system call by a running process
A user REQUEST to create a new process
Initiation of a batch job

37
Q

set of all processes in the system

A

Job queue

38
Q

selects which processes should be brought into the ready queue.

A

Long-term scheduler (job scheduler)

39
Q

When is job scheduling done?

A

If there is not enough room in the main memory for all processes in the job queue

40
Q

[Process States, Ready] contains set of all processes residing in main memory, ready and waiting to execute

A

Ready queue

41
Q

selects which process should be executed (dispatched) next and allocates CPU

A

Short-term scheduler (CPU scheduler)

42
Q

a module that gives control of the CPU to the process selected by the short-term scheduler

A

Dispatcher

43
Q

[Process States, Running] events that may occur while process is being executed (RESR)

A

—issues an I/O REQUEST and then be placed in an I/O queue.
—The time slice allotted to the process in CPU has EXPIRED
—creates a new SUBPROCESS (forks a child) and waits for its termination.
—forcibly REMOVED from the CPU as a result of an interrupt and then be placed back in the ready queue

44
Q

[Process States, Terminated] Process terminates are due to: (NEFK)

A

Normal exit (voluntary)
Error exit (voluntary)
Fatal error (involuntary)
Killed by another process (involuntary)

45
Q

When does waiting or blocked state becomes suspended

A

when swapped to disk to free up more memory

45
Q

When does waiting or blocked state becomes suspended

A

when swapped to disk to free up more memory

46
Q

Additional states (R, BW, BS, RS)

A

Ready – process in main memory and available for execution
Blocked/Waiting – process in main memory and awaiting an event
Blocked/Suspend – process in secondary memory and awaiting an event
Ready/Suspend – process in secondary memory and available for execution

47
Q

Three states once a process is created (RRB)

A

Ready
Run
Blocked

48
Q

Reasons for a process to be blocked (MILT)

A

MESSAGE: Waiting for a message from another process
I/O: Waiting for I/O completion
LOAD: Waiting for the code to be fully loaded in memory
TIME: Waiting for a particular time of day

49
Q

Transitions (DBWP)

A

Dispatch
Block
Wakeup
Preempt

50
Q

Transition from READY to RUN

A

Dispatch

51
Q

transition from RUN to BLOCKED

A

Block

52
Q

transition from BLOCKED to READY

A

Wakeup

53
Q

transition from RUN to READY

A

Preempt

54
Q

Two types of process termination (NA)

A

Normal
Abnormal

55
Q

process termination due to a call by the process to a termination statement

A

Normal termination

56
Q

the forced termination of the process by the OS due to some unrecoverable error such as bound violation, arithmetic error, and invalid instruction

A

Abnormal termination

57
Q

—Responsible for allocating the CPU among various ready processes in the system
—Usually called after an interrupt has been served
—Ask the job scheduler for the process most suitable to take control of the CPU

A

Dispatchers

58
Q

[Schedulers] Selects form among those READY processes in memory

A

Short-term scheduler (CPU Scheduler)

59
Q

[Schedulers] Determines which jobs are admitted to the system

A

Long-term scheduler (job scheduler)

60
Q

Long-Term Scheduling Properties (EMASP)

A

Expected runtime
Maximum memory size
Amount of I/O
Special resources required (tape, disk)
Priority/deadlines

61
Q

Short-Term Scheduling Algorithms (P, NP)

A

Preemptive
Non-preemptive

62
Q

[CPU Scheduling]
—Scheduling strategy where the CPU is suspended when a higher priority process is in the ready queue
—Currently running process may be interrupted and moved to the ready state by the operating system
—Allows for better service since any one process cannot monopolize the processor for very long

A

Preemptive

63
Q

[CPU Scheduling]
—Scheduling strategy where even if a higher priority process is ready, the running process is allowed to continue until either it is blocked or completes its execution
—Once a process is in the running state, it will continue until it terminates or blocks itself for I/O

A

Non-preemptive

64
Q

time it takes for the dispatcher to stop one process and start another running

A

Dispatch latency

65
Q

[CPU Scheduling] The process that requested the CPU first is allocated first

A

First-Come First-Served Scheduling (FCFS)

66
Q

[CPU Scheduling] Is FCFS preemptive or non-preemptive?

A

Non-preemptive

67
Q

[CPU Scheduling] Scheduling is done thru the next CPU burst rather than the total length of the process

A

Shortest Job First (SJF)

68
Q

[CPU Scheduling] Is SJF preemptive or non-preemptive?

A

Both (preemptive is SRTF or Shortest Remaining Time First)

69
Q

[CPU Scheduling]
—A priority number (integer) is associated with each process
—The CPU is allocated to the process with the highest priority

A

Priority Scheduling

70
Q

[Priority Scheduling] Rule in priority scheduling

A

Smallest integer has highest priority

71
Q

[CPU Scheduling] Is Priority Scheduling preemptive or non-preemptive?

A

Both (non-preemptive = NPP, preemptive = PP)

72
Q

[CPU Scheduling]
—time slicing
—designed especially for time-sharing systems
—similar to FCFS, but preemption is added to switch between process

A

Round Robin (RR)

73
Q

[CPU Scheduling] Is Round Robin preemptive or non-preemptive?

A

Preemptive

74
Q

[CPU Scheduling] Process with the highest response ratio is executed next

A

Highest-Response-Ratio-Next (HRRN)

75
Q

[CPU Scheduling] Is HRRN preemptive or non-preemptive?

A

Non-preemptive

76
Q

[CPU Scheduling] How is response ratio computed?

A

(Waiting time + burst time)/burst time

77
Q

[CPU Scheduling]
—Ready queue is partitioned into separate queues
—Jobs are permanently assigned to 1 queue
—Each queue has its own scheduling algorithm

A

Multi-Level Queue (MLQ)

78
Q

[CPU Scheduling] A process can move between the various queues; aging can be implemented this way

A

Multilevel Feedback Queue (MLFQ)

Operating System - Midterms (4 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions