Computer Organization: Instruction Formats, Cycles, Control Units, and Memory Hierarchy

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

1/29

flashcard set

Earn XP

Description and Tags

Vocabulary practice flashcards covering instruction formats, computer instruction execution cycles, control unit design, memory hierarchy, RAM/ROM architectures, and cache mapping schemes.

30 Terms

1
New cards

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.

2
New cards

One Address Instruction

An instruction format that uses an implied accumulator (ACAC) register for data manipulation, requiring only one explicit register or memory operand in the instruction.

3
New cards

Two Address Instruction

A common commercial instruction format specifying two addresses where the destination address can also serve as an operand source.

4
New cards

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.

5
New cards

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.

6
New cards

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.

7
New cards

Program Counter (PC)

A processor register that holds the memory address of the next instruction to be fetched.

8
New cards

Instruction Register (IR)

A processor register that holds the most recently fetched instruction.

9
New cards

Instruction Cycle Code (ICC)

A 2-bit register designating the processor's current cycle state: 0000 for Fetch, 0101 for Indirect, 1010 for Execute, and 1111 for Interrupt.

10
New cards

Indirect Cycle

An instruction cycle phase that retrieves source operands from memory using indirect addressing, always followed immediately by the Execute Cycle.

11
New cards

Interrupt Cycle

A cycle executed at the end of an Execute Cycle if an enabled interrupt has occurred, saving the current PCPC to memory and loading the interrupt-handling routine address into PCPC.

12
New cards

Horizontal Micro-programmed Control Unit

A control unit design where control signals are represented in decoded binary format (1 bit per control signal1\text{ bit per control signal}), producing longer control words, requiring no decoders, and offering higher parallelism.

13
New cards

Vertical Micro-programmed Control Unit

A control unit design where control signals are encoded into binary fields (log⁡2(n)\log_2(n) bits for nn signals), resulting in shorter control words, requiring decoders, and allowing low parallelism (00 or 11).

14
New cards
<p>Hardwired Control Unit</p>

Hardwired Control Unit

A control unit architecture that generates control signals using fixed combinational logic circuits, decoders, and state matrices rather than stored microprograms.

15
New cards

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.

16
New cards
<p>Memory Hierarchy Design</p>

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.

17
New cards

Byte Addressable Memory

A memory configuration where each uniquely addressable cell holds exactly 8 bits8\text{ bits} (1 byte1\text{ byte}) of data.

18
New cards

Word Addressable Memory

A memory configuration where each uniquely addressable cell size equals the word length of the CPU rather than a single byte.

19
New cards
<p>Static RAM (SRAM)</p>

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.

20
New cards
<p>Dynamic RAM (DRAM)</p>

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.

21
New cards

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.

22
New cards
<p>2D Memory Organization</p>

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 MARMAR.

23
New cards
<p>2.5D Memory Organization</p>

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.

24
New cards

Hit Ratio

A metric measuring cache performance defined as the ratio of cache hits to total CPU memory accesses: HitsHits+Misses\frac{\text{Hits}}{\text{Hits} + \text{Misses}}.

25
New cards

Direct Mapping

A cache mapping technique where each main memory block maps to exactly one specific cache line determined by i=j(modm)i = j \pmod m, where ii is the line number, jj is the memory block number, and mm is the number of cache lines.

26
New cards

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.

27
New cards

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)i = j \pmod v) and can be placed in any line within that set.

28
New cards

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.

29
New cards

Spatial Locality

The principle of locality stating that memory locations situated physically near a currently referenced memory location are likely to be accessed soon.

30
New cards

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.