1/29
Vocabulary practice flashcards covering instruction formats, computer instruction execution cycles, control unit design, memory hierarchy, RAM/ROM architectures, and cache mapping schemes.
Zero Address Instruction
An instruction format used by stack-based computers that does not contain an address field, relying on an implicit stack where expressions are evaluated using postfix (reverse Polish) notation.
One Address Instruction
An instruction format that uses an implied accumulator (AC) register for data manipulation, requiring only one explicit register or memory operand in the instruction.
Two Address Instruction
A common commercial instruction format specifying two addresses where the destination address can also serve as an operand source.
Three Address Instruction
An instruction format specifying three addresses (typically two source operands and one destination operand), which decreases program size but increases the instruction bit length.
Memory Address Register (MAR)
A register connected directly to the address lines of the system bus that specifies the address in memory for a read or write operation.
Memory Buffer Register (MBR)
A register connected to the data lines of the system bus that holds the data to be stored in memory or the last value read from memory.
Program Counter (PC)
A processor register that holds the memory address of the next instruction to be fetched.
Instruction Register (IR)
A processor register that holds the most recently fetched instruction.
Instruction Cycle Code (ICC)
A 2-bit register designating the processor's current cycle state: 00 for Fetch, 01 for Indirect, 10 for Execute, and 11 for Interrupt.
Indirect Cycle
An instruction cycle phase that retrieves source operands from memory using indirect addressing, always followed immediately by the Execute Cycle.
Interrupt Cycle
A cycle executed at the end of an Execute Cycle if an enabled interrupt has occurred, saving the current PC to memory and loading the interrupt-handling routine address into PC.
Horizontal Micro-programmed Control Unit
A control unit design where control signals are represented in decoded binary format (1 bit per control signal), producing longer control words, requiring no decoders, and offering higher parallelism.
Vertical Micro-programmed Control Unit
A control unit design where control signals are encoded into binary fields (log2(n) bits for n signals), resulting in shorter control words, requiring decoders, and allowing low parallelism (0 or 1).

Hardwired Control Unit
A control unit architecture that generates control signals using fixed combinational logic circuits, decoders, and state matrices rather than stored microprograms.
Nanoinstruction Memory
A secondary control memory in a two-level control store that stores unique control signal combinations to avoid storing duplicate operation fields in the main microinstruction memory.

Memory Hierarchy Design
An architectural structure arranging memory levels from fast, costly, low-capacity storage (registers/cache) to slow, inexpensive, high-capacity storage (secondary disks) to minimize average access time based on locality of reference.
Byte Addressable Memory
A memory configuration where each uniquely addressable cell holds exactly 8 bits (1 byte) of data.
Word Addressable Memory
A memory configuration where each uniquely addressable cell size equals the word length of the CPU rather than a single byte.

Static RAM (SRAM)
A type of volatile memory constructed using circuits similar to flip-flops (typically cross-coupled inverters and pass transistors) that retains data as long as continuous power is supplied without requiring refresh cycles.

Dynamic RAM (DRAM)
A high-density volatile memory constructed of a single transistor and capacitor per cell that stores data as an electric charge and requires periodic recharging every few milliseconds.
Double-Data-Rate SDRAM (DDR SDRAM)
An enhanced synchronous DRAM that doubles data transfer rate by transferring data on both the rising and falling edges of the clock signal.

2D Memory Organization
A memory layout where memory cells are arranged in rows and columns and a single decoder selects the entire row (word line) corresponding to the address in the MAR.

2.5D Memory Organization
A memory layout that utilizes two separate decoders (a row decoder and a column decoder) to select individual memory cells, reducing gate count and facilitating error correction.
Hit Ratio
A metric measuring cache performance defined as the ratio of cache hits to total CPU memory accesses: Hits+MissesHits.
Direct Mapping
A cache mapping technique where each main memory block maps to exactly one specific cache line determined by i=j(modm), where i is the line number, j is the memory block number, and m is the number of cache lines.
Associative Mapping
A flexible cache mapping technique where any block of main memory can be placed into any line of the cache, using associative memory to search tags simultaneously.
Set-Associative Mapping
A hybrid cache mapping scheme that groups cache lines into sets; each memory block maps to a specific set (i=j(modv)) and can be placed in any line within that set.
Temporal Locality
The principle of locality stating that an instruction or data item referenced currently has a high probability of being referenced again in the near future.
Spatial Locality
The principle of locality stating that memory locations situated physically near a currently referenced memory location are likely to be accessed soon.
Miss Penalty
The additional time or clock cycles required to fetch a block of data from a lower level in the memory hierarchy into the cache upon a cache miss.