Brainscape's Knowledge GenomeTM

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


See full index

M362 - Definitions > Unit 02 > Flashcards

Unit 02 Flashcards

1
Q

activation frames

A

A data structure storing information about a method call in Java that allows the method to resume after being placed on a stack.

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

batch process

A

A process that does not require user interaction.

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

blocked process

A

A process that is unable to proceed because it is waiting for some event to occur.

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

buffer

A

An area of memory used for communication between processes or devices.

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

busy-waiting

A

Repeatedly checking and rechecking some condition in a loop until it becomes true.

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

cache

A

An area of high-speed memory local to the CPU holding recently accessed data.

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

compilation

A

The process by which source code is translated into machine code in one operation.

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

context

A

A record of the condition of a process at a point in time, that is, the internal state of the process (not to be confused with process state, which is a categorisation of the process at a higher level).

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

context switch

A

The saving of the context of one process and the loading of the context of another.

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

context switching

A

The act of performing a context switch.

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

cooperative multitasking

A

Multitasking that is dependent on processes voluntarily ceding way to each other from time to time.

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

cooperative multithreading

A

Multithreading that is dependent on threads voluntarily ceding way to each other from time to time.

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

daemon thread

A

A thread that runs without interaction and which the JVM does not have to wait for when exiting.

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

data width

A

The amount of data that a device can handle at a time.

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

device controller

A

A piece of hardware that can interact with a device independently of a system processor.

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

device driver

A

A piece of software used to communicate with a hardware device.

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

short-term scheduler. (aka dispatcher)

A

A process scheduler concerned mainly with which process is allowed to run next.

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

event-dispatching thread

A

A Java thread that can be used to respond to events in GUIs.

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

faults

A

A class of interrupt caused by hardware failure.

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

fetch–execute cycle

A

The cycle by which the next instruction to be executed is retrieved and completed by a CPU.

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

heap

A

A dynamically allocated area of memory used to store objects in the JVM.

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

interpreted (programming language)

A

A programming language where source code is translated to machine code in stages rather than all at once.

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

interrupt

A

A mechanism by which a device or software can signal that an event has occurred.

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

interrupt handler

A

A software routine responsible for managing interrupts.

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

interrupt rate limiting

A

A technique employed by hardware to prevent a flood of interrupts being created.

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

interrupt storm

A

The condition under which more interrupts are generated than can be dealt with.

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

I/O interrupts

A

The class of interrupts concerned with input and output events.

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

Java Runtime Environment (JRE)

A

An implementation of the Java Virtual Machine specification, providing an environment supporting the loading and running of Java programs and support from library code.

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

Java Virtual Machine (JVM)

A

A specification for the Java Runtime Environment.

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

thread (aka lightweight process)

A

A lightweight process; a thread of execution.

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

long-term scheduler

A

A process scheduler that controls the admission of new processes to a system to achieve a desirable mix of runnable processes.

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

machine code

A

Platform-dependent, CPU-specific, low-level code.

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

medium-term scheduler

A

A process scheduler that manages the swapping of processes to and from secondary storage.

34
Q

multitasking

A

Execution of several tasks at the same time, whether by parallel or concurrent processing techniques.

35
Q

multithreaded

A

Containing more than one thread.

36
Q

multithreaded operating system

A

An operating system that supports multithreaded processes.

37
Q

non-pre-emptive multitasking

A

A process scheduling policy allowing a process to run to completion before applying a selection function.

38
Q

normalised turnaround time

A

The value q/s, where q is the turnaround time and s is the service time.

39
Q

null process

A

A process executed by the scheduler when no other processes are Runnable; can be used to perform housekeeping tasks or to simplify a scheduling algorithm.

40
Q

persistent storage

A

Storage that does not require power (cf. volatile) such as a disk drive.

41
Q

platform

A

The combination of hardware and software underlying a program’s execution.

42
Q

polling

A

The technique of repeatedly checking for an event.

43
Q

pre-emptive multitasking

A

A process scheduling policy that may require a process to give up the CPU before it would ordinarily have done so.

44
Q

pre-emptive multithreading

A

A thread scheduling policy that may require a thread to give up the CPU before it has completed running.

45
Q

priority

A

A number used to indicate the importance of a process, thread or interrupt.

46
Q

privileged instructions

A

Machine code instructions that may only be executed by a processor in supervisor mode.

47
Q

process

A

A program under execution.

48
Q

process descriptor

A

A data structure containing sufficient information about a process to allow it to be paused and restarted.

49
Q

process identifier

A

A unique value (ID) distinguishing one process from another.

50
Q

process scheduler

A

A general term for software that manages process state transitions according to a scheduling policy.

51
Q

process state

A

A high-level categorisation of a process in terms of what it may do next, for example, Runnable or Blocked.

52
Q

process table

A

A data structure used by an operating system to store information about processes.

53
Q

program counter

A

A pointer to the next instruction to be executed in a program.

54
Q

program interrupts

A

A class of interrupt generated by software due to an exception.

55
Q

quantum

A

A time during which a process may run under a pre-emptive scheduling policy.

56
Q

registers

A

High-speed memory, local to the CPU, used to execute instructions.

57
Q

responsiveness

A

An indication of whether a system is acceptably fast in its response to a request for action or information (the definition of what is acceptable depends on the context).

58
Q

runnable process

A

A process that may be selected to be run; same as a ready process.

59
Q

running process

A

A process that is being executed by the CPU.

60
Q

runtime environment

A

The software environment supporting loading, linking to libraries and execution of programs.

61
Q

scheduling policy

A

A policy contributing to process state change at any given time and in particular determining which process is allowed to run.

62
Q

selection function

A

A function used by a scheduler to select which process is allowed to run.

63
Q

service time

A

The time a process would run if it had sole use of the CPU.

64
Q

short-term scheduler

A

A process scheduler concerned mainly with which process is allowed to run next.

65
Q

stack

A

A last-in, first-out (LIFO) data structure, used to store activation records for Java threads.

66
Q

supervisor call interrupt

A

An interrupt used to signal that supervisor instructions are to be executed.

67
Q

supervisor mode

A

The mode a CPU enters to execute supervisor instructions.

68
Q

suspended process (aka swapped out)

A

A process that is stored on a disk; same as swapped out.

69
Q

swapping

A

The action of moving a process from volatile to persistent storage.

70
Q

system bus

A

A hardware channel for data transmission between device controllers and CPU.

71
Q

task

A

A sequence of instructions treated as an element of work. A task may be represented by a method in a Java program, for example, but the term is more widely applied and can refer to elements of work at a low (processor) or high (application) level.

72
Q

thread

A

A lightweight process; a thread of execution.

73
Q

thread of execution

A

A path of execution within a process.

74
Q

throughput

A

The number of processes completed per unit of time by a CPU.

75
Q

timer interrupts

A

A class of interrupt used to keep track of the passage of time; used by schedulers to pre-empt processes.

76
Q

turnaround

A

The time interval between the submission of a process and its completion.

77
Q

user mode

A

The CPU mode when it is executing ordinary (not supervisor) instructions.

78
Q

user thread

A

A thread created by a user; a non-daemon thread.

79
Q

virtual memory

A

External memory; persistent storage used to supplement main memory.

80
Q

volatile storage

A

Storage that requires power in order to retain any data stored in it, for example RAM, cache and registers.

M362 - Definitions (12 decks)

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