CS250 Exam 2

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

1/61

flashcard set

Earn XP

62 Terms

1
New cards

Procedure

A stored subroutine that performs a specific task based on the parameters with which it is provided.

2
New cards

Branch-and-link instruction

An instruction that branches to an address and simultaneously saves the address of the following instruction in a register (LR or X30 in LEGv8).

3
New cards

Return address

A link to the calling site that allows a procedure to return to the proper address; in LEGv8 it is stored in register LR (X30).

4
New cards

Caller

The program that instigates a procedure and provides the necessary parameter values.

5
New cards

Callee

A procedure that executes a series of stored instructions based on parameters provided by the caller and then returns control to the caller.

6
New cards

Program counter

The register containing the address of the instruction in the program being executed.

7
New cards

Stack

A data structure for spilling registers organized as a last-in-first-out queue.

8
New cards

Stack pointer

A value denoting the most recently allocated address in a stack that shows where registers should be spilled or where old register values can be found. In LEV v8, it is register SP .

9
New cards

Push

Add elements to stack.

10
New cards

Pop

Remove elements from stack.

11
New cards

Procedure frame

The segment of the stack containing a procedure’s saved registers and local variables.

12
New cards

Frame pointer

A value denoting the location of the saved registers and local variables for a given procedure.

13
New cards

Text segment

The segment of a UNIX object file that contains the machine language code for routines in the source file.

14
New cards

PC-relative addressing

An addressing regime in which the address is the sum of the program counter (PC) and a constant in the instruction.

15
New cards

Addressing mode

One of several addressing regimes delimited by their varied use of operands and/or addresses.

16
New cards

Dividend

A number being divided.

17
New cards

Divisor

A number that the dividend is divided by.

18
New cards

Quotient

The primary result of a division, a number that when multiplied by the divisor and added to the remainder produces the dividend.

19
New cards

Remainder

The secondary result of a division; a number that when added to the product of the quotient and the divisor produces the dividend.

20
New cards

Scientific notation

A notation that renders numbers with a single digit to the left of the decimal point.

21
New cards

Normalized

A number in floating-point notation that has no leading 0s.

22
New cards

Floating point

Computer arithmetic that represents numbers in which the binary point is not fixed.

23
New cards

Fraction

The value, generally between 0 and 1, placed in the fraction field. It is also called the mantissa.

24
New cards

Exponent

In the numerical representation system of floating-point arithmetic, the value that is placed in the exponent field.

25
New cards

Overflow (floating-point)

A situation in which a positive exponent becomes too large to fit in the exponent field.

26
New cards

Underflow (floating-point)

A situation in which a negative exponent becomes too large to fit in the exponent field.

27
New cards

Double precision

A floating-point value represented in a 64-bit doubleword.

28
New cards

Single precision

A floating-point value represented in a 32-bit word.

29
New cards

Exception

An unscheduled event that disrupts program execution; used to detect overflow.

30
New cards

Interrupt

An exception that comes from outside of the processor. (Some architectures use the term interrupt for all exceptions.

31
New cards

Guard

The first of two extra bits kept on the right during intermediate calculations of floating-point numbers; used to improve rounding accuracy.

32
New cards

Round

Method to make the intermediate floating-point result fit the floating-point format; the goal is typically to find the nearest number that can be represented in the format. It is also the name of the second of two extra bits kept on the right during intermediate floating-point calculations, which improves rounding accuracy.

33
New cards

Units in the last place

The number of bits in error in the least significant bits of the significand between the actual number and the number that can be represented.

34
New cards

Sticky bit

A bit used in rounding in addition to guard and round that is set whenever there are nonzero bits to the right of the round bit.

35
New cards

Fused multiply add

A floating-point instruction that performs both a multiply and an add, but rounds only once after the add.

36
New cards

Combinational element

An operational element, such as an AND gate or an ALU.

37
New cards

State element

A memory element, such as a register or a memory.

38
New cards

Clocking methodology

The approach used to determine when data is valid and stable relative to the clock.

39
New cards

Edge-triggered clocking

A clocking scheme in which all state changes occur on a clock edge.

40
New cards

Control signal

A signal used for multiplexor selection or for directing the operation of a functional unit; contrasts with a data signal, which contains information that is operated on by a functional unit.

41
New cards

Asserted

The signal is logically high or true.

42
New cards

Deasserted

The signal is logically low or false.

43
New cards

Datapath element

A unit used to operate on or hold data within a processor. In the LEGv8 implementation, these include the instruction and data memories, the register files, the ALU, and adders.

44
New cards

Register file

A state element that consists of a set of registers that can be read and written by supplying a register number to be accessed.

45
New cards

Sign-extend

To increase the size of a data item by replicating the high-order sign bit of the original data item in the high-order bits of the larger, destination data item.

46
New cards

Branch target address

The address specified in a branch, which becomes the new program counter (PC) if the branch is taken. In the LEGv8 architecture, the branch target is given by the sum of the offset field of the instruction and the address of the branch.

47
New cards

Branch taken

A branch where the branch condition is satisfied and the program counter (PC) becomes the branch target. All unconditional branches are taken branches.

48
New cards

Branch not taken

A branch where the branch condition is false and the program counter (PC) becomes the address of the instruction that sequentially follows the branch.

49
New cards

Truth table

From logic, a representation of a logical operation by listing all the values of the inputs and then each case showing what the resulting outputs should be.

50
New cards

Don’t-care term

An element of a logical function in which the output does not depend on the values of all inputs. Don’t-care terms may be specified in different ways

51
New cards

Opcode

The field that denotes the operation and format of an instruction.

52
New cards

Single-cycle implementation

An implementation in which an instruction is executed in one clock cycle. While easy to understand, it is too slow to be practical.

53
New cards

Pipelining

An implementation technique in which multiple instructions are overlapped in execution, much like an assembly line.

54
New cards

Structural hazard

When a planned instruction cannot execute in the proper clock cycle because the hardware does not support the combination of instructions that are set to execute.

55
New cards

Data hazard

When a planned instruction cannot execute in the proper clock cycle because data that is needed to execute the instruction are not yet available.

56
New cards

Forwarding

A method of resolving a data hazard by retrieving the missing data element from internal buffers rather than waiting for it to arrive from programmer-visible registers or memory.

57
New cards

Load-use data hazard

A specific form of data hazard in which the data being loaded by a load instruction has not yet become available when it is needed by another instruction.

58
New cards

Pipeline stall

A stall initiated in order to resolve a hazard.

59
New cards

Control hazard

When the proper instruction cannot execute in the proper pipeline clock cycle because the instruction that was fetched is not the one that is needed; that is, the flow of instruction addresses is not what the pipeline expected.

60
New cards

Branch prediction

A method of resolving a branch hazard that assumes a given outcome for the conditional branch and proceeds from that assumption rather than waiting to ascertain the actual outcome.

61
New cards

Latency (pipeline)

The number of stages in a pipeline or the number of stages between two instructions during execution.

62
New cards

nop

An instruction that does no operation to change state.