Newly Annotated Words
Hysteresis: A word used to describe the situation, where a change in behavior does not change the result, but rather more than one instance of the change is necessary to change the result. Our example of choice is the saturating counter for branch prediction. If you have a one-bit counter, you just predict whatever you did last time. If you have a two-bit counter, it takes two Not Takens to predict not taken. A three-bit counter requires 4 Not Takens to predict not taken. The point is you continue to predict taken until you cross the threshhold. The fact that you do not change your prediction immediately is an example of hysteresis. I first studiedthe concept in my magnetic fields course, and the analogy is clear. ...but that is a subject for another time.
Inflight: Instructions are inflight if they have been fetched but not yet retired.
Von Neumann Bottleneck: Code and data are in the same memory in a Von Neumann machine. If one pipelines the instruction flow, one can easily find oneself in the position of going to memory for data and the same time one is fetching (going to memory for) the next instruction. This contention for memory is what is called the VonNeumann bottleneck. Note that in reality this is not a problem since we long ago recognized it an provided separate Instruction and Data caches, which means while we are going to memory for data, we are really accessing the Data Cache, and while we are fetching the next instruction, we are accessing the Instruction Cache.Ergo, no bottleneck.
List of Buzzwords:
2-BIT SATURATING COUNTER
2-LEVEL ADAPTIVE BRANCH PREDICTOR
ACTIVE WINDOW
AMDAHL'S LAW
ARBITRATION (CENTRAL, DISTRIBUTED)
BACKWARD TAKEN FORWARD NOT TAKEN (BTFN) BRANCH PREDICTOR
BINAID
BRANCH HISTORY REGISTER
BRANCH INTERFERENCE
BRANCH PREDICTOR (RUN TIME V COMPILE TIME)
BRANCH TARGET BUFFER
BUBBLE
BUS CYCLE
BUS MASTER, SLAVE
CONCURRENCY
CONSISTENT STATE
CONTROL DEPENDENCIES
DAE
DAISY CHAIN
DATA DEPENDENCIES
DATA FLOW GRAPH
DATA FORWARDING
DEGREE OF PARALLELIZABILITY
DUTY CYCLE
EXCEPTIONS - OVERFLOW,INVALID,INEXACT,UNDERFLOW,DIVIDE BY 0
EXPONENT
FAULTS vs TRAPS
FLYNN'S BOTTLENECK
FULL WINDOW STALL
GAG, SAS, PAP, ...
GRADUAL UNDERFLOW
GSHARE
HANDLER (SERVICE ROUTINE)
HAZARDS
HEP
HYSTERESIS
I/O
IN FLIGHT
IN ORDER Vs OUT OF ORDER INSTRUCTION STREAM
INTERRUPT VECTORS
INTERRUPT
LIVE IN
LOCKSTEP
MACHINE CHECK
MIMD
MISPREDICTION PENALTY
MULTIPLEXED BUS
NODE
PATTERN HISTORY TABLE
PHASE BEHAVIOR
PIPELINE STAGE
PIPELINING
POST INCREMENT/AUTO INCREMENT
PRECISE EXCEPTION
PRIORITY ARBITRATION UNIT (PAU)
PRIORITY
PROCESS
PROFILING
QUIET EXCEPTION
RADIX
READ AFTER WRITE HAZARD
REGISTER BYPASSING
REGISTER RENAMING
REORDER BUFFER
RESERVATION STATION
RISC
ROUNDING MODES - ROUND UP,ROUND DOWN,CHOP OFF,ROUND TO NEAREST
SCOREBOARD
SERIAL BOTTLENECK
SIB BYTE
SIGNALLING EXCEPTION
SIMD
SPECULATIVE EXECUTION
SPLIT TRANSACTION
STRIP MINING
SUB NORMAL NUMBER
SYNCHRONOUS, ASYNCHRONOUS BUS
THREAD
TOMASULO
TRACE SCHEDULING
ULP
VECTOR CHAINING
VECTOR LENGTH
VECTOR STRIDE
VECTOR TABLE
VECTOR, ARRAY PROCESSING
VECTORIZABILITY
VLIW
VON NEUMANN BOTTLENECK
WIDE ISSUE
WOBBLE