Day 7 Flashcards Preview

Super Robot Monkey Team Hyper Force Go > Day 7 > Flashcards

Flashcards in Day 7 Deck (46):
1

A(n) _______ condition occurs due to a process depending on the timely output of another process.

Race

2

_________ scheduling is a non-preemptive algorithm that utilizes a priority to determine when the process will run?

Priority

3

Excessive swapping is known as ________.

Thrashing

4

On a 32 bit system, virtual memory extends memory demands by providing a logical _____ of addressable space for every process.

2 GB

5

Linux device drivers are installed as __________ in the /lib directory.

LKM

6

Virtual memory is commonly implemented through the use of which of the following?

Virtual addressing, page directories, page tables, swap/page file.

7

VMware ESXi Server is an example of a _____ VMM.

Type 1

8

List examples of preemptive scheduling algorithms.

Round robin, multilevel queue, multilevel feedback queue

9

Tracks data that is stored in cache.

Transaction look aside buffer

10

Uses physical disk space to store memory data that is not actively being used in RAM

Swap/page file

11

Every process has one. It contains entries used to point to specific page table entries.

Page Directories

12

Usable by process resources in user mode, these identify the page directory entry, the page table, and the offset.

Virtual Addresses

13

It contains pages that identify the page frame address of the data being sought

Page tables

14

Holds global and static variables which exist throughout the life of the program.

Data

15

Used to store the compiled code of the currently running program.

Text

16

Part of the computer's memory which is reserved for external libraries of code and shared memory.

Free Space

17

This memory is used by non-static, local variables that are explicitly declared in a program. It is efficiently managed by the CPU allowing very fast access to variable data.

Stack

18

Used for dynamically allocated memory and is uninitialized at first.

Heap

19

This type of Linux device is expected to utilize the system calls such as read() and write() and transfers data one block at a time.

Block device

20

This windows _______ routine is used to register the rest of the driver with the operating system.

Initialization

21

When an interrupt occurs, the kernel traps the current executing process/thread and changes its state to _______?

Wait

22

The ______ is used to track info stored in cache.

Transaction look-aside buffer TLB

23

(True or False) traps only deal with exceptions.

False

24

The ____ schedules between threads using switching.

Dispatcher

25

_____ is the amount of time the process takes to react to user request.

Response time

26

_________ memory management is characterized by only allowing a single process to exist in RAM at a time.

Single user contiguous

27

Used to initiate a data transfer to or from a device.

Start I/O Routine

28

Used to send a driver notification whenever a new device is detected. These drivers support PnP.

Add-device routine

29

These are the main functions provided by a device driver. When called on to perform an I/O operation, the OS initiates this routine.

Dispatch Routine

30

Primarily used in controlling ISR's. For instance, once the ISR is completed, the DPC is used in ending the interrupt and returning to normal scheduling.

Deferred Procedure Routine

31

When a device interrupts, the kernel schedules the interrupt and transfers control here.

Interrupt Service Routine

32

Called when the LKM is loaded. It is used to register the rest of the driver's routines with the OS.

Initialization Routine

33

List examples of non-preemptive scheduling algorithms.

First come-first served, shortest job first, priority.

34

A(n) _____ scheduling algorithm allows a process to run for a set amount of time called a quantum.

Preemptive

35

A ____ condition may occur due to a process depending on the timely output sequence of another process.

Race

36

On a multi-processing system, the simultaneous scheduling of multiple processes is known as ______?

Concurrency

37

_____ is a concept used by virtual memory to divide each process into small chunks.

Paging

38

(True or False) The upper 2 GB of memory on a 32 bit OS is reserved for user space process memory requirements,

True

39

(True or False) A process is a small segment of code that is spawned and used by a thread at a much lower cost than creating and managing an entirely new thread.

False

40

_______ are used to identify the page frame addresses of the desired info.

Page table entries PTE

41

Called when the LKM is loaded. It is used to register the rest of the driver's routines with the OS.

initialization Routine

42

These routines equate to the windows dispatch routines and can be subcatergorized as Open, Release, Read, Write, Llseek, and loCtl dispatches.

File Operations Routine

43

Devices are identified using numbers 0-255

Device Naming Routines

44

_____ is defined by the number of processes terminated in a set amount of time.

Throughput

45

(True or False) An application will not become a process until it is executed.

True

46

A _______ is an instance of a OS executing on a virtual system.

Virtual machine