Chapter 4 Flashcards

(41 cards)

1
Q

An inactive unit, such as a file stored on a disk

To an OS, this is a unit of work that has been submitted by the user

A

program

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

An active entity that requires a set of resources, including a processor and special registers, to perform its function.

Also called a task, is a single instance of a program in execution

A

Process

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

A portion of a process that can run indepen
dently

A

thread

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

The part of the machine that performs the calculations and executes the programs.

A

processor

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

Was driven by the problems caused by nano-sized transistors and their ultra-close placement on a computer chip

A

multi-core engineering

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

Solution to the problem of the amount of heat generated by a chip

A

Single chip with two or more processor cores

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

The Processor Manager is a composite of two submanagers: one in charge of job scheduling and the other in charge of process scheduling. They’re known as the _______ and the __________

A

Job Scheduler, Process Scheduler

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

also called as the high-level scheduler

A

Job Scheduler

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

also called as the low-level scheduler

A

Process Scheduler

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

In a highly interactive environment, there’s also a third layer of the Processor Manager called the ___________

A

middle-level scheduler

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

five states of job status or process status

A

HOLD to READY to RUNNING to WAITING and eventually to FINISHED

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

As a job moves through the system, it’s always in one of five state. These are called:

A

job status or process status

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

Each process in the system is represented by a data structure called a:

A

Process Control Block (PCB)

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

Contains the basic information about the job, including what it is, where it’s going, how much of its processing has been completed, where it’s stored, and how much it has spent in using resources

A

Process Control Block (PCB)

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

Contents of each job’s Process Control Block.

A
  • Process identification
  • Process status
  • Process state:
    - Process status word
    - Register contents
    - Main memory
    - Resources
    -Process priority
  • Accounting
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Each job is uniquely identified by the user’s identification and a pointer connecting it to its descriptor

A

Process Identification

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

This indicates the current status of the job—HOLD, READY, RUNNING, or WAITING—and the resources responsible for that status.

A

Process Status

18
Q

This contains all of the information needed to indicate the current state of the job

A

Process State

19
Q

This contains information used mainly for billing purposes and performance measurement

20
Q

It use PCBs to track jobs the same way customs officials use passports to track international visitors

21
Q

Before the operating system can schedule them, it needs to resolve three limitations of the system:

A

(1) there are a finite number of resources (such as disk drives, printers, and tape drives);

(2) some resources, once they’re allocated, can’t be shared with another job (e.g., printers);

(3) some resources require operator intervention—that is, they can’t be reassigned automatically from job to job (such as tape drives)

22
Q

Good process scheduling policy criterias

A
  • Maximize throughput
  • Minimize response time
  • Minimize turnaround time
  • Minimize waiting time
  • Maximize CPU efficiency
  • Ensure fairness for all jobs
23
Q

A scheduling strategy that interrupts the processing of a job and transfers the CPU to another job is called a ________________

A

preemptive scheduling policy

24
Q

Alternative of preemptive scheduling policy, which functions without external interrupts

A

nonpreemptive scheduling policy

25
a nonpreemptive scheduling algorithm that handles jobs according to their arrival time: the earlier they arrive, the sooner they’re served.
First-come, first-served (FCFS)
26
a nonpreemptive process scheduling policy (or algorithm) that selects the waiting job with the shortest CPU cycle time
Shortest job next (SJN)
27
a nonpreemptive algorithm and one of the most common scheduling algorithms in batch systems, this algorithm gives preferential treatment to important jobs. it allows the programs with the highest priority to be processed first, and they aren’t interrupted until their CPU cycles (run times) are completed or a natural wait occurs
Priority scheduling
28
Priorities can also be determined by the Processor Manager based on characteristics intrinsic to the jobs such as:
- memory requirements - number and type of peripheral devices - total CPU time - amount of time already spent in the system
29
is the preemptive version of the SJN algorithm the processor is allocated to the job closest to completion—but even this job can be pre empted if a newer job in the READY queue has a time to completion that’s shorter.
Shortest remaining time (SRT)
30
a preemptive process scheduling algorithm that is used extensively in interactive systems. it’s based a predetermined slice of time that’s given to each job to ensure that the CPU is equally shared among all active processes and isn’t monopolized by any one job
round robin
31
This time slice is called a ________ and its size is crucial to the performance of the system.
time quantum
32
time quantum varies from:
100 milliseconds to 1 or 2 seconds
33
a process scheduling scheme (used with other scheduling algorithms) that groups jobs according to a common characteristic.
Multiple-level queues
34
There are four primary methods to the movement:
Case 1: No Movement Between Queues Case 2: Movement Between Queues Case 3: Variable Time Quantum Per Queue Case 4: Aging
35
_______________ means that a job’s execution is delayed for an undefined amount of time because it is repeatedly preempted so other jobs can be processed
indefinite postponement
36
occur as a direct result of the arithmetic operation or job instruction currently being processed
Internal interrupts or synchronous interrupts
37
Illegal arithmetic operations, such as the following, can generate interrupts:
* Attempts to divide by zero * Floating-point operations generating an overflow or underflow * Fixed-point addition or subtraction that causes an arithmetic overflow
38
Illegal job instructions, such as the following, can also generate interrupts:
* Attempts to access protected or nonexistent storage locations * Attempts to use an undefined operation code * Operating on invalid data * Attempts to make system changes, such as trying to change the size of the time quantum
39
The control program that handles the interruption sequence of events is called the _________
interrupt handler
40
An I/O request is called a _______ in multi programming environments
natural wait
41
To schedule the CPU, the Process Scheduler takes advantage of a common trait among most computer programs: they alternate between ___________
CPU cycles and I/O cycles