OA Flashcards
1
Q
superscalar
A
Technique primarily associated with hardware.
Functional units (ALU, Floating Point Unit, Load/Store Unit) are duplicated in the pipeline of a superscalar processor which allows the hardware to issue multiple instructions to each unit simultaneously.
2
Q
LEGv8 doubleword
A
Another natural unit of access in a computer, usually a group of 64 bits (8 bytes); corresponds to the size of a register in the LEGv8 architecture
3
Q
virtual memory
A
A technique that uses main memory as a “cache” for secondary storage
The address is broken into a virtual page number and a page offset
4
Q
Program counter (PC)
A
The register that contains the address of the next instruction to be executed
5
Q
LDUR
A
load register
6
Q
Register File
A
A state element that consists of a set of registers that can be read and written by supplying a register number to be accessed.
provides 1024 scalar 32-bit registers for up to 64 threads.
7
Q
machine language
A
The language made up of binary-coded instructions that is used directly by the computer
8
Q
system software
A
The set of programs that enables a computer’s hardware devices and application software to work together; it includes the operating system and utility programs.
9
Q
operating system
A
(computer science) software that controls the execution of computer programs and may provide various services
10
Q
Assembly Language
A
Programming language that has the same structure and set of commands as machine languages but allows programmers to use symbolic representations of numeric machine code.
11
Q
IBM 360/91
A
Introduced many new concepts, including dynamic detection of memory hazards, generalized forwarding, and reservation stations. Tomasulo’s algorithm
The internal organization of the 360/91 shares many features with the Pentium III and Pentium 4, as well as with several other microprocessors. One major difference was that there was no branch prediction in the 360/91 and hence no speculation. Another major difference was that there was no commit unit, so once the instructions finished execution, they updated the registers.
12
Q
Dynamic Random Access Memory (DRAM)
A
Memory built as an integrated circuit; it provides random access to any location. Access times are 50 nanoseconds and cost per gigabyte in 2012 was $5 to $10.
Multiple DRAMs are used together to contain the instructions and data of a program. In contrast to sequential access memories, such as magnetic tapes, the RAM portion of the term DRAM means that memory accesses take basically the same amount of time no matter what portion of the memory is read.
Modern DRAMS consist of rows in each bank
13
Q
frame buffering
A
A portion of RAM containing a bitmap that drives a video display. It is a memory buffer containing a complete frame of data.
The image to be represented onscreen is stored in the frame buffer, and the bit pattern per pixel is read out to the graphics display at the refresh rate. The animation below shows a frame buffer with a simplified design of just 4 bits per pixel.
14
Q
Datapath
A
The component of the processor that performs arithmetic operations
15
Q
Control
A
The component of the processor that commands the datapath, memory, and I/O devices according to the instructions of the program.
16
Q
Integrated circuit
A
Also called a chip. A device combining dozens to millions of transistors.
17
Q
Central processor unit (CPU)
A
Also called processor. The active part of the computer, which contains the datapath and control and which adds numbers, tests numbers, signals I/O devices to activate, and so on.
18
Q
Static random access memory (SRAM)
A
Also memory built as an integrated circuit, but faster and less dense than DRAM.
19
Q
Instruction set architecture
A
Also called architecture. An abstract interface between the hardware and the lowest-level software that encompasses all the information necessary to write a machine language program that will run correctly, including instructions, registers, memory access, I/O, and so on.
20
Q
Application binary interface (ABI)
A
The user portion of the instruction set plus the operating system interfaces used by application programmers. It defines a standard for binary portability across computers.
21
Q
Volatile memory
A
Storage, such as DRAM, that retains data only if it is receiving power.
22
Q
Nonvolatile Memory
A
A form of memory that retains data even in the absence of a power source and that is used to store programs between runs. A DVD disk is nonvolatile.
23
Q
Magnetic disk
A
Also called hard disk. A form of nonvolatile secondary memory composed of rotating platters coated with a magnetic recording material. Because they are rotating mechanical devices, access times are about 5 to 20 milliseconds and cost per gigabyte in 2012 was $0.05 to $0.10
24
Q
Main memory
A
Also called primary memory. Memory used to hold programs while they are running; typically consists of DRAM in today’s computers.
25
Secondary memory
Nonvolatile memory used to store programs and data between runs; typically consists of flash memory in PMDs and magnetic disks in servers.
26
Flash memory
A nonvolatile semiconductor memory. It is cheaper and slower than DRAM but more expensive per bit and faster than magnetic disks. Access times are about 5 to 50 microseconds and cost per gigabyte in 2012 was $0.75 to $1.00.
27
Single Instruction Single Data (SISD)
A uniprocessor
28
Multiple Instruction Multiple Data (MIMD)
The conventional MIMD programming model, where a single program runs across all processors.
29
Single Instruction Stream, Multiple Data Streams (SIMD)
The same instruction is applied to many data streams, as in a vector processor.
30
Data-level parallelism
Parallelism achieved by performing the same operation on independent data
31
LEGv8
assembly instructions
32
data hazard (pipeline 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.
33
forwarding (bypassing)
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
34
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.
35
Pipelining
Technique that allows the CPU to work on more than one instruction at a time
Formula
total process time = [longest task * (total load -1)] + total load time
36
R-format ALU operations
Requires register file and the ALU.
37
Program Counter (PC)
(PC)
The register that contains the address of the next instruction to be executed
38
output
The results of the operation of any system.
39
spatial locality
The principle stating that if a data location is referenced, data locations with nearby addresses will tend to be referenced soon.
40
RAID 2
Bit-level striping with dedicated Hamming-code parity. OBSOLETE.
41
Application Binary Interface (ABI)
The user portion of the instruction set plus the operating system interfaces used by application programmers. It defines a standard for binary portability across computers.
42
Smaller is faster
A very large number of registers may increase the clock cycle time simply because it takes electronic signals longer when they must travel farther.
Guidelines such as "smaller is faster" are not absolutes; 31 registers may not be faster than 32. Even so, the truth behind such observations causes computer designers to take them seriously. In this case, the designer must balance the craving of programs for more registers with the designer's desire to keep the clock cycle fast. Another reason for not using more than 32 is the number of bits it would take in the instruction format.
43
commit unit
The unit in a dynamic or out-of-order execution pipeline that decides when it is safe to release the result of an operation to programmer-visible registers and memory.
44
in-order commit
A commit in which the results of pipelined execution are written to the programmer-visible state in the same order that instructions are fetched.
45
Exception Enable (Interrupt Enable)
A signal or action that controls whether the process responds to an exception or not; necessary for preventing the occurrence of exceptions during intervals before the processor has safely saved the state needed for restart.
46
Weak scaling
Speed-up achieved on a multiprocessor while increasing the size of the problem proportionally to the increase in the number of processors.
Not bound by Amdah's Law
47
Write serialization
Method that ensures writes to a location are seen in the same order by all processors.
Maintaining the order of writes to a given location ensures that all processors sharing memory read the correct data.
48
multimedia extensions (MMX)
An expanded set of instructions supported by a processor that provides multimedia-specific functions.
49
temporal locality
The principle stating that if a data location is referenced then it will tend to be referenced again soon.
50
Memory hierarchy
A structure that uses multiple levels of memories; as the distance from the processor increases, the size of the memories and the access time both increase.
51
Block (or line)
The minimum unit of information that can be either present or not present in a cache.
52
Hit rate
The fraction of memory accesses found in a level of the memory hierarchy.
53
Miss rate
The fraction of memory accesses not found in a level of the memory hierarchy
54
miss penalty
The time required to fetch a block into a level of the memory hierarchy from the lower level, including the time to access the block, transmit it from one level to the other, insert it in the level that experienced the miss, and then pass the block to the requestor.
55
Hit time
The time required to access a level of the memory hierarchy, including the time needed to determine whether the access is a hit or a miss.
56
Parallelization
consist of dividing a program into separate components that run in parallel on individual computers in the cluster
57
ARM architecture
can support 16-bit
58
Amdahl's Law
A formula used to find the maximum improvement possible by improving a particular part of a system. In parallel computing, Amdahl's law is mainly used to predict the theoretical maximum speedup for program processing using multiple processors
59
multiprocessor
A term used to refer to a computer with more than one CPU.
60
Uniform Memory Access (UMA)
A multiprocessor in which latency to any word in main memory is about the same no matter which processor requests the access.
61
Non-Uniform Memory Access (NUMA)
Varying system memory access times, because of system hardware.
62
loop unrolling
A technique to get more performance from loops that access arrays, in which multiple copies of the loop body are made and instructions from different iterations are scheduled together.
63
Blocking
a failure to retrieve information that is available in memory even though you are trying to produce it
can help reduce cache miss rate
64
Set Associative Cache
A cache that has a fixed number of locations (at least two) where each block can be placed.
65
RAID 0 (Disk Striping)
Disk Striping. Disk striping requires at least two drives. It does not provide redundancy to data. If any one drive fails, all data is lost.
66
RAID 1 (mirroring)
Two drives are used in unison, and all data is written to both drives, giving you a mirror or extra copy of the data, in the case that one drive fails
67
RAID 3
Byte-level striping with dedicated parity. OBSOLETE, replaced with RAID 5.
68
RAID 4
Block-level striping with dedicated parity. Not often used, replaced with RAID 5.
69
RAID 5
Disk striping with parity. RAID-5 uses three or more disks and provides fault tolerance.
70
RAID 6
Disk striping with parity. RAID-6 uses four or more disks and provides fault tolerance. It can survive the failure of two drives.
71
silicon crystal ingot
A rod composed of a silicon crystal that is between 8 and 12 inches in diameter and about 12 to 24 inches long.
72
wafer
A slice from a silicon ingot no more than 0.1 inches thick, used to create chips.
73
Instruction Set Architecture (ISA)
Also called architecture. An abstract interface between the hardware and the lowest-level software that encompasses all the information necessary to write a machine language program that will run correctly, including instructions, registers, memory access, I/O, and so on
74
Transistor
An on/off switch controlled by an electric signal
75
very large-scale integrated (VLSI) circuit
A device containing hundreds of thousands to millions of transistors.
76
silicon
A natural element that is a semiconductor
1. Excellent conductors of electricity (using either microscopic copper or aluminum wire)
2. Excellent insulators from electricity (like plastic sheathing or glass)
3. Areas that can conduct or insulate under special conditions (as a switch)
77
Semiconductor
A substance that can conduct electricity under some conditions
78
Die
The individual rectangular sections that are cut from a wafer, more informally known as chips.
79
complementary metal-oxide semiconductor (CMOS)
Dominant technology for integrated circuits
80
LEGv8 word
A natural unit of access in a computer, usually a group of 32 bits
81
LEGv8 register
64 bits wide
more registers will lead to a slower clock frequency
82
Data transfer instruction
A command that moves data between memory and registers.
83
Address
A value used to delineate the location of a specific data element within a memory array.
84
load
data transfer instruction that copies data from memory to a register
85
LEGv8 LDUR
The sum of the constant portion of the instruction and the contents of the second register forms the memory address
The U in LDUR stands for unscaled immeditate
86
base address
starting address of an array in memory (5000 below)
87
base register
register that holds an array's base address (X22 below)
88
offset
a constant value added to a base address to locate a particular array element (8 below)
89
Big Endian
A CPU or memory architecture in which the most significant byte is stored at the lowest memory address.
90
store register
instruction complementary to load. It copies data from register to memory.
the format is similar to load; name of the operation, followed by the register to be stored, then the base register, and finally the offset to select the array element.
91
LEGv8 STUR
store register
92
spilling register
The process of putting less frequency used variables (or those needed later into memory)
93
reservation station
A buffer within a functional unit that holds the operands and the operation.
94
Reorder Buffer
The buffer that holds results in a dynamically scheduled processor until it is safe to store the results to memory or a register.
95
out-of-order execution
A situation in pipelined execution when an instruction blocked from executing does not cause the following instructions to wait.
96
VLIW
A style of instruction set architecture that launches many operations that are defined to be independent in a single wide instruction, typically with many separate opcode fields
97
ARMv8 virtual memory
64-bit addressed. The upper 16 bits are not used, so only 48 bits are used.
it is allocated by loads the page table register to refer to the page table of the process.
ARMv8 allows implementations with a smaller virtual address. It also allows physical addresses as large as 48 bits. It supports three options for a minimum page or granule size: 4, 16, and 64 Kibibyte.
98
address translation (address mapping)
the process by which a virtual address is mapped to an address used to access memory
99
Exception Syndrome Register (ESR)
record the cause of the exception
100
FADDS, FSUBS
Single-precision arithmetic
101
FADDD, FSUBD, FMULD, FDIVD
Double-precision arithmetic
102
FCMPS, FCMPD
Single- and double-precision comparison
103
motivations for virtual memory
1. To allow efficient and safe sharing of memory among several programs and to remove the programming burdens of a small, limited amount of main memory [still being used today]
2. To allow a single user program to exceed the size of primary emmory.
104
physical address
An address in main memory.
105
Protection
A set of mechanisms for ensuring that multiple processes sharing the processor, memory or I/O devices cannot interfere, intentionally or unintentionally, with one another by reading or writing each other's data. These mechanism also isolate the operating system from a user process.
106
page
a virtual memory block.
all virtual memory system relocate the program as a set of fixed-size blocks
107
page fault
a virtual memory miss
108
virtual address
An address that corresponds to a location in virtual space and is translated by address mapping to a physical address when memory is accessed.
109
page table
The table containing the virtual to physical address translations in a virtual memory system. The table, which is stored in memory, is typically indexed by the virtual page number; each entry in the table contains the physical page number for that virtual page if the page is currently in memory.
indexed by the page number from the virtual address
110
swap space
The space on the disk reserved for the full virtual memory space of a process
111
Reference Bit (Use Bit or Access Bit)
A field that is set whenever a page is accessed and that is used to implement LRU or other replacement schemes.
ARMv8 calls it an access bit
112
Techniques for reducing total max storage required
1. Keep a limit register that restrict the size of the page table for a given process and add more entries as needed.
2. A limit register for each segment specifies the current size of the segment, which grows in units of pages. This type of segmentation is used by many architectures, including ARMv8 and MIPS. Unlike the type of segmentation discussed in a previous elaboration, this form of segmentation is invisible to the application program, although not to the operating system. This does not work when the address space is used sparsely rather than contiguous.
3. Apply a hashing function to the virtual address so that the table need to be only the size of the number of physical pages in the main memory. AKA inverted page table. Lookup process can be more complex because it is not indexed
4. Allow the page tables to be paged. It works by allowing the page tables to reside in the virtual address space.
5. Multiple levels of page tables and is the solution that ARMv8 uses to reduce the memory footprint of address translation. This scheme allows the address space to be used in a sparse fashion (multiple noncontiguous segments can be active) without having to allocate the entire page table. Useful with very large address spaces and in software systems that require noncontiguous allocation. The primary disadvantage of this multi-level mapping is the more complex process for address translation.
113
Least Recently Used (LRU)
A replacement scheme in which the block replaced is the one that has been unused for the longest time
114
dirty bit
indicates if a page has been written since being read into memory
115
Translation Lookaside Buffer (TLB)
A cache that keeps track of recently used address mappings to try to avoid an access to the page table. Can be used to improve access performance by relying on locality of reference
TLB size: 16-512 entries
Block size: 1-2 page table entries (typically 4-8 bytes each)
Hit time: 0.5-1 clock cycle
Miss penalty: 10-100 clock cycles
Miss rate: 0.01%-1%
116
The Intrinsity FastMATH TLB
The memory system uses 4 KiB pages and just a 32-bit address space; thus, the virtual page number is 20 bits long. The physical address is the same size as the virtual address. The TLB contains 16 entries, it is fully associative, and it is shared between the instruction and data references. Each entry is 64 bits wide and contains a 20-bit tag (which is the virtual page number for that TLB entry), the corresponding physical page number (also 20 bits), a valid bit, a dirty bit, and other bookkeeping bits. Like most ARMv8 systems, it uses software to handle TLB misses.
117
TLB miss
indicates that a page is not in the TLB. Another process then finds and loads the missing page.
118
TLB events combination
+-------+-------------+-------+------------+
| TLB | Page table | Cache | Result |
+-------+-------------+-------+------------+
| Hit | Hit | Miss | Possible |
| Miss | Hit | Hit | Possible |
| Miss | Hit | Miss | Possible |
| Miss | Miss | Miss | Possible |
| Hit | Miss | Miss | Impossible |
| Hit | Miss | Hit | Impossible |
| Miss | Miss | Hit | Impossible |
+-------+-------------+-------+------------+
119
virtually addressed cache
A cache that is accessed with a virtual address rather than a physical address
Does not use the TLB
120
Aliasing
A situation in which two addresses access the same object; it can occur in the virtual memory when there are two virtual addresses for the same physical page
121
Physically addressed cache
A cache that is addressed by a physical address.
122
context switch
A changing of the internal state of the processor to allow a different process to use the processor that includes saving the state needed to return to the currently executing process.
123
syscall
Generates a system call exception that transfers control to the processor and allows access to a dedicated location in supervisor code space. The process returns to user mode via the RET instruction.
124
L1 cache (primary cache)
a cache for a cache
125
L2 cache
A cache for main memory
It is faster than memory, but tends to be larger and slower than the L1 cache
126
Virtual machines
Developed in the mid-1960s.
Benefits:
Managing software
Managing hardware
127
virtual machine manager (VMM)
Hypervisor
usually, run in system mode while guest VM run in user mode.
hardware = host
VMs = guest
It determines how to map virtual resources to physical resources.
It is also much smaller than a traditional OS; the isolation portion of a VMM is only 10,000 lines of code
128
Instruction Set Architecture (ISA)
The part of the computer architecture related to programming, including the native data types, instructions, registers, addressing modes, memory architecture, interrupt and exception handling, and external I/O.
129
Memory Hierarchy
concept that is necessary for the CPU to be able to manipulate data.
130
Strong scaling
Speed-up achieved on a multiprocessor without increasing the size of the problem.
131
multiprocessor architecture
A unified graphics and computing multiprocessor executes vertex, geometry, and pixel fragment shader programs, and parallel computing programs
advantages:
Increased throughput
Cost saving
Increased reliability
132
Streaming processor (SP)
the primary thread instruction processor in the multiprocessor
133
Special function unit (SFU)
Compute 32-bit floating-point approximations to reciprocal, reciprocal square root, and key transcendental functions. It also implements 32-bit floating-point planar attribute interpolation for pixel shaders, providing accurate interpolation of attributes such as color, depth, and texture coordinates.
134
Uniform Memory Access (UMA)
A multiprocessor in which latency to any word in main memory is about the same no matter which processor requests the access.
135
Non-Uniform Memory Access (NUMA)
Varying system memory access times, because of system hardware.
136
throughput
the amount of work performed by a system during a given period of time
137
CPU Time Formula
(Instructions) x (CPI) x (Clock Cycle Time)
138
Set Associative Cache
A cache that has a fixed number of locations (at least two) where each block can be placed
(Block number) modulo (Num set in the cache)
Variable
one-way - Original set
two-way - Will improve overall performance
four-way
eight-way
139
Fully associative cache
A cache structure in which a block can be placed in any location in the cache.
140
CDC 6600
This system is widely considered to have been the first supercomputer. Also first load-store architecture
141
Tomasulo's Algorithm
An algorithm for dynamic scheduling and out-of-order execution
uses dynamic hazard detection, generalized forwarding, and reservation stations.
142
IBM 7030
AKA Stretch
Produced with the goal of being 100 times faster than the previous IBM 704
143
Imprecise interupt
The unpopularity of imprecise interrupts led to the standard of commit units in dynamically scheduled pipelined processors
144
Digital Equipment Corporation (DEC)
A major American company in the computer industry from the 1950s to the 1990s
145
PDP-8
First commercial minicomputer introduced by Digital Equipment Corporation
cost under $20,000
146
Intel 4004
First microprocessor
147
supercomputer
a particularly powerful mainframe computer.
148
Seymour Cray
American inventor of the Cray supercomputer.
149
Least Significant Bits
The two bits furthest to the right
150
most significant bit
left most bit
151
Sign and magnitude representation
a signed number representation where a single bit is used to represent the sign and the remaining bits represent the magnitude
152
sign extension
function of a copy signed load is to copy the sign repeatedly to fill the rest of the register
153
LEGv8 fields
1. opcode - 11 bits - basic operation of the instruction
2. rm - 5 bits - the second register source operand
3. shamt - 6 bits - shift amount
4. rn - 5 bits - the first register source operand
5. rd - 5 bits - the register destination operand
154
B.EQ
equal
B.NE
not equal
B.LT
less than
B.LE
less than or equal to
B.GT
greater than
B.GE
greater than or equal to
B.EQ
equal
B.NE
not equal
B.LT
less than
B.LE
less than or equal to
B.GT
greater than
B.GE
greater than or equal to
155
condition codes (flag)
4 bits are used
In MIPS, two registers are compared and the result of the comparison is stored in a third register. Then a conditional branching statement assess the value of the third register to see if the condition is true or false.
Negative (N)
Zero (Z)
Overflow (V)
Carry (C)
156
B.MI
branch on minus
N=1
B.PL
branch on plus
N=0
B.VS
branch on overflow set
V=1
B.VC
branch on overflow clear
V=0
B.MI
branch on minus
N=1
B.PL
branch on plus
N=0
B.VS
branch on overflow set
V=1
B.VC
branch on overflow clear
V=0
157
branch-and-link instruction
An instruction that branches to an address simultaneously saves the address of the following instruction in a register
(LR or X30 in LEGv8).
158
Return address
A link to the calling site that allows a procedure to return to the proper address; in MIPS it is stored in register
LR (X30)
159
Caller
The program that instigates a procedure and provides the necessary parameter values.
160
Callee
A procedure that executes a series of stored instructions based on parameters provided by the caller and then returns control to the caller.
161
overflow (floating point)
A situation in which a positive exponent becomes too large to fit in the exponent field.
162
underflow (floating point)
A situation in which a negative exponent becomes too large to fit in the exponent field.
163
double precision
A floating-point value represented in 64-bit words.
164
single precision
A floating-point value represented in a single 32-bit word.
165
subword parallelism (data level parallelism)
Given that the parallelism occurs within a wide word
They are known as well as vector or SIMD, for single instruction, multiple data (see COD Section 6.6 (Introduction to graphics processing units)). The rising popularity of multimedia applications led to arithmetic instructions that support narrower operations that can easily compute in parallel.
166
accumulator
Archaic term for register. On-line use of it as a synonym for "register" is a fairly reliable indication that the user has been around quite a while
167
Load-Store Architecture (register-register architecture)
An instruction set architecture in which all operations are between registers and data memory may only be accessed via loads of stores
168
RISC Architecture
Reduced instruction set computer architecture
Relies on small and simple instructions instead of more complex and specialized instructions. Most current instruction set employ the architecture model
169
High-level-language computer architecture
Proposed in the 1960s, high-level-language architecture failed to make much of a commercial impact. Better compilers and programming languages, and growing memory sizes led to this architecture's demise.
170
Accumulator Architecture
One operand of a binary operation is implicitly in the accumulator
The earliest computers had only one register to perform arithmetic operations. All operations would accumulate in the single register, called the accumulator.
171
Stack Architecture
no register
In the 1960s, believing that compilers were not good at register allocation, some companies eliminated registers and instead transferred operands onto and off of the stack, similar to what was done in Hewlett-Packard calculators.
172
ARMv7
ARM started as the processor for the Acorn computer, hence its original name of Acorn RISC Machine. The Berkeley RISC papers influenced its architecture.
173
ARMv8
extension of ARMv7 with 64-bit address. ARM took the opportunity to redesign the instruction set to make it look much more like MIPS than like earlier ARM versions
174
SDIV
Signed divide
SUBI
subtract immediate
MVZ
move wide with zero
STUR
store register
LSL
logical shift left
LSR
Logical Shift Right
SDIV
Signed divide
SUBI
subtract immediate
MVZ
move wide with zero
STUR
store register
LSL
logical shift left
LSR
Logical Shift Right
175
Coprocessor
an additional chip that accelerates a portion of the work of a processor; in this case, it accelerated floating-point computation
176
Combinational element
An operational element, such as an AND gate or an ALU.
177
State element
A memory element, such as a register or a memory.
178
clocking methodology
defines when signals can be read and when they can be written
179
Edge-triggered clocking
any values stored in a sequential logic element are updated only on a clock edge
Edge-triggered state elements make simultaneous reading and writing both possible and unambiguous.
180
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.
181
Asserted
The signal is logically high or true
182
Deasserted
The signal is logicall low or false.
183
rising clock edge
0 to 1
falling clock edge
1 to 0
rising clock edge
0 to 1
falling clock edge
1 to 0
184
Sign-extend
To increate the size of 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.
185
Branch target address
the address specified in a branch, which becomes the new program counter if the branch is taken. In the LEGv8 archtecture, the branch target is given by the sum of the offset field of the instruction and the address of the branch
186
Branch taken
A branch where the branch condition is satisfied and the program counter becomes the branch target. All unconditional branches are taken branches
187
branch not taken or (untaken branch)
A branch where the branch condition is false and the program counter (PC) becomes the address of the instruction that sequentially follows the branch.
188
ALUOp
the 4-bit ALU control input using a small control unit that has as inputs the opcode field of the instruction and a 2-bit control field
indicates whether the operation to be performed should be add (00) for loads and stores, pass input b (01) for CBZ, or be determined by the operation encoded in the opcode field (10)
10 is ORR, AND, SUB, ADD (R-type)
00 is LDUR, STUR
01 is CBZ
189
ALU control lines
0000 is AND
0001 is OR
0010 is ADD
0110 is SUBTRACT
0111 PASS INPUT B
1100 is NOR
190
Pipeline stall (bubble)
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.
191
control hazard (branch 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.
192
Branch prediction
A method of resolving a branch hazard that assumes a given outcome for the branch and proceeds from that assumption rather than waiting to ascertain the actual outcome.
193
five-stage pipeline
five instructions will be in execution during any single clock cycle
1. IF - instruction fetch
2. ID - instruction decode and register file read
3. EX - execution or address calculation
4. MEM - data memory access
5. WB - write back
194
Instruction Fetch (IF)
Move instruction from memory to the control unit
195
Instruction decode (ID)
Pull apart the instruction, set up the operation in the ALU, and compute the source and destination operand addresses
196
Execute (EX)
ALU is used to perform the instruction's operation or to compute an address, or an adder is used for branches; both are depicted using an ALU symbol.
197
Data memory access (MEM)
the data memory (DM) may be read (for a load instruction) or written (for a store instruction). For load, the right half is shaded, indicating read. (For store, the left half would be shaded).
198
Write back (WB)
the register file (Reg) may be written by certain instructions (like R-type instructions). The left half is shaded to indicate write (vs. read). Although two Reg icons appear in the stylized depictions, only one register file exists.
199
Branch prediction buffer
Also called branch history table. A small memory that is indexed by the lower portion of the address of the branch instruction and that contains one or more bits indicating whether the branch was recently taken or not.
200
Dynamic branch prediction
prediction of branches at runtime using runtime information
201
Branch target buffer
A structure that caches the destination PC or destination instruction for a branch. It is usually organized as a cache with tags, making it more costly than a simple prediction buffer.
202
Correlating predictor
A branch predictor that combines local behavior of a particular branch and global information about the behavior of some recent number of executed branches.
203
Tournament branch predictor
A branch predictor with multiple predictions for each branch and a selection mechanism that chooses which predictor to enable for a given branch.
204
Microarchitecture
The organization of the processor, including the major functional units, their interconnection, and control.
205
Architectural registers
The instruction set of visible registers of a processor; for example, in MIPS, these are the 32 integer and 16 floating point registers
206
Three Cs model
A cache model in which all cache misses are classified into one of three categories: compulsory misses, capacity misses, and conflict misses
207
compulsory miss (cold-start miss)
a cache miss caused by the first access to a block that has never been in the cache
Both large block sizes and prefetching may reduce compulsory misses
208
compulsory miss (cold-start miss)
a cache miss caused by the first access to a block that has never been in the cache
Both large block sizes and prefetching may reduce compulsory misses
209
capacity miss
A cache miss that occurs because the cache, even with full associativity, cannot contain all the blocks needed to satisfy the request.
Increase cache size may decrease capacity misses and increase access time
210
conflict miss (collision miss)
A cache miss that occurs in a set-associative or direct-mapped cache when multiple blocks compete for the same set and that are eliminated in a fully associative cache of the same size
Increases associativity may decrease miss rate and increase access time.
211
Finite-state machine
A sequential logic function consisting of a set of inputs and outputs, a next-state function that maps the current state and the inputs to a new state, and an output function that maps the current state and possibly the inputs to a set of asserted outputs.
212
Next-state machine
A combinational function that, given the inputs and the current state, determines the next state of a finite-state machine.
213
cache ready signal
set in the Compare Tag state if requested read or write is a hit
214
memory ready signal
set in the Write Back state when a block is written to memory and in the Allocate state when a memory read is completed.
215
Consistency
ensure that writes to a location by different processors are seen in the same order by all processors. It is defines when written values will be returned by a read
216
Coherence
ensures that a read of a data item returns the most recently written value of that data item. It defines what values can be returned by a read
217
snooping
a popular cache coherence protocol.
Each cache contains a copy of data from a block of physical memory along with a copy of the sharing status of that block. Each cache contains a controller that monitors, or snoops, activity on a shared communication medium to determine if any action is needed to ensure cache coherence.
218
write invalidate protocol
enforcing coherence is to ensure that a processor has exclusive access to a data item before it writes that item
219
R-Format Instructions
They all read two registers, perform an ALU operation on the contents of the registers, and write the result to a register. We call these instructions either R-type instructions or arithmetic-logical instructions (since they perform arithmetic or logical operations). This instruction class includes ADD, SUB, AND, and ORR,
Need an ALU to operate on the values read from the registers.
220
Multiprocessing
The simultaneous execution of two or more instructions at the same time
221
Multithreading
allows multiple commands, or threads to run simultaneously
