Computer Organization: Memory System and Input/Output Organization

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

1/52

flashcard set

Earn XP

Description and Tags

Comprehensive vocabulary flashcards covering the Memory System and Input/Output Organization modules based on Computer Organization by Carl Hamacher, Zvonko Vranesic, and Safwat Zaky.

53 Terms

1
New cards

Memory Access Time

The time that elapses between the initiation of an operation and the completion of that operation in a memory system.

2
New cards

Memory Cycle Time

The minimum time delay required between the initiation of two successive memory operations (for example, the time between two successive Read operations).

3
New cards

Word Line

A common line connected to all cells in a row of a memory cell array, driven by the address decoder to activate or select that entire memory word.

4
New cards

Static RAM (SRAM)

A type of volatile memory consisting of circuits (such as flip-flops/latches) capable of retaining their state as long as power is applied, offering access times of a few nanoseconds at a relatively high cost.

5
New cards

SRAM Cell Circuit

A memory cell structure where two transistor inverters are cross-connected to implement a basic flip-flop (latch), connected to bit lines bb and b′b' through access switch transistors T1T_1 and T2T_2 controlled by the word line.

<p>A memory cell structure where two transistor inverters are cross-connected to implement a basic flip-flop (latch), connected to bit lines $$b$$ and $$b'$$ through access switch transistors $$T_1$$ and $$T_2$$ controlled by the word line.</p>
6
New cards

CMOS SRAM Cell

An SRAM cell realization where transistor pairs (T3,T5)(T_3, T_5) and (T4,T6)(T_4, T_6) form inverters in a cross-coupled latch, providing low power consumption and quick access times.

<p>An SRAM cell realization where transistor pairs $$(T_3, T_5)$$ and $$(T_4, T_6)$$ form inverters in a cross-coupled latch, providing low power consumption and quick access times.</p>
7
New cards

Dynamic RAM (DRAM)

A type of volatile memory where information is stored as a charge on a capacitor within a cell; because the charge leaks within tens of milliseconds, the contents must be periodically refreshed.

8
New cards

Single-Transistor Dynamic Memory Cell

A compact dynamic memory cell consisting of one transistor TT and a storage capacitor CC, where activating the word line turns on TT to connect CC to the bit line for read, write, or refresh operations.

<p>A compact dynamic memory cell consisting of one transistor $$T$$ and a storage capacitor $$C$$, where activating the word line turns on $$T$$ to connect $$C$$ to the bit line for read, write, or refresh operations.</p>
9
New cards

Row Address Strobe (RAS) and Column Address Strobe (CAS)

Control signals in a dynamic memory chip with multiplexed addressing: RAS‾\overline{\text{RAS}} latches the high-order row address bits, and CAS‾\overline{\text{CAS}} latches the low-order column address bits.

10
New cards

Synchronous DRAM (SDRAM)

A DRAM whose operations and control logic are directly synchronized with an external processor clock signal, allowing rapid bursts of successive data words using an internal column counter.

<p>A DRAM whose operations and control logic are directly synchronized with an external processor clock signal, allowing rapid bursts of successive data words using an internal column counter.</p>
11
New cards

Memory Latency

The amount of time it takes to transfer a word of data to or from memory.

12
New cards

Memory Bandwidth

The number of bits or bytes of data that can be transferred to or from a memory unit in one second.

13
New cards

Double-Data-Rate SDRAM (DDR SDRAM)

A synchronous DRAM design featuring two cell array banks that transfers data externally on both the rising and falling edges of the clock signal, doubling the effective data transfer rate.

14
New cards

SIMMs and DIMMs

Single In-line Memory Modules and Dual In-line Memory Modules; small printed circuit boards populated with memory chips that plug vertically into motherboard sockets to economize space and facilitate memory expansion.

15
New cards

Memory Controller

A specialized circuit positioned between the processor and DRAM memory that accepts the full address issued simultaneously by the processor, splits it into row and column addresses, and generates RAS‾\overline{\text{RAS}} and CAS‾\overline{\text{CAS}} timing signals.

16
New cards

Rambus Memory

A DRAM-based memory architecture using a narrow, high-speed bus with fast differential signaling operating at frequencies such as 400 MHz400\,\text{MHz}, using multiple cell array banks to compete directly with DDR SDRAM.

17
New cards

Read-Only Memory (ROM)

A non-volatile memory designed for reading during normal operation, retaining permanent instructions (such as OS boot routines) even when the power supply is cut off.

<p>A non-volatile memory designed for reading during normal operation, retaining permanent instructions (such as OS boot routines) even when the power supply is cut off.</p>
18
New cards

Programmable Read-Only Memory (PROM)

A ROM variant allowing user programming by selectively burning out internal fuses at point PP via high-current pulses to insert logic 11s into an initially all-00 cell array in an irreversible process.

19
New cards

Erasable Programmable Read-Only Memory (EPROM)

A non-volatile memory cell using a floating-gate transistor where data is written by injecting trapped charge and erased entirely by exposing the physically removed chip to ultraviolet (UV) light.

20
New cards

Electrically Erasable Programmable Read-Only Memory (EEPROM)

A non-volatile memory whose contents can be selectively erased and rewritten electrically within the system, although it requires different voltages for erasing, writing, and reading.

21
New cards

Flash Memory

A high-density non-volatile memory technology based on single-transistor trapped-charge cells that allows reading of individual cells but requires entire blocks to be erased before rewriting.

22
New cards

Memory Hierarchy

The multilevel arrangement of storage devices ordered by speed, cost per bit, and capacity: processor registers at the top, followed by L1 cache, L2 cache, main memory (SIMMs/DIMMs), and magnetic disk secondary storage.

<p>The multilevel arrangement of storage devices ordered by speed, cost per bit, and capacity: processor registers at the top, followed by L1 cache, L2 cache, main memory (SIMMs/DIMMs), and magnetic disk secondary storage.</p>
23
New cards

Locality of Reference

The programmatic tendency to execute localized instructions repeatedly over periods of time, classified as temporal locality (recently used items are likely to be reused soon) or spatial locality (items with adjacent addresses are likely to be accessed soon).

24
New cards

Cache Hit and Cache Miss

A cache hit occurs when the requested memory word is currently present in the cache; a cache miss occurs when the data is absent, requiring a block transfer from main memory to the cache.

25
New cards

Write-Through Protocol

A cache write policy in which every write operation updates both the cache block and the corresponding main memory location simultaneously.

26
New cards

Write-Back Protocol

A cache write policy (also known as copy-back) where only the cache is updated and marked with a dirty (modified) bit, delaying the update of main memory until that block is replaced.

27
New cards

Load-Through (Early-Restart)

An optimization technique where, upon a read miss, the requested word is immediately forwarded to the processor as soon as it arrives, without waiting for the entire memory block to finish loading into the cache.

28
New cards

Direct Mapping

A cache mapping scheme in which each main memory block maps to a fixed, predetermined cache block according to the formula j(mod128)j \pmod{128}, resolving contention simply by replacing the resident block.

<p>A cache mapping scheme in which each main memory block maps to a fixed, predetermined cache block according to the formula $$j \pmod{128}$$, resolving contention simply by replacing the resident block.</p>
29
New cards

Associative Mapping

A cache mapping method in which any main memory block can reside in any block location within the cache, identifying blocks via tag bits that are compared in parallel.

<p>A cache mapping method in which any main memory block can reside in any block location within the cache, identifying blocks via tag bits that are compared in parallel.</p>
30
New cards

Set-Associative Mapping

A hybrid cache mapping function where cache blocks are grouped into sets, allowing a block from main memory to reside in any block position within its assigned set.

<p>A hybrid cache mapping function where cache blocks are grouped into sets, allowing a block from main memory to reside in any block position within its assigned set.</p>
31
New cards

Least Recently Used (LRU) Replacement Algorithm

A cache replacement algorithm used in associative and set-associative caches that identifies and overwrites the block that has gone the longest time without being referenced.

32
New cards

Memory Interleaving

A technique that divides main memory into separate physical modules with individual Address Buffer Registers (ABR) and Data Buffer Registers (DBR), distributing consecutive addresses across consecutive modules to enable parallel memory accesses.

33
New cards

Lockup-Free Cache

A cache architecture designed with special tracking registers and control logic capable of supporting multiple outstanding cache misses simultaneously without halting other accesses during a prefetch or miss.

34
New cards

Virtual Memory Organization

A system architecture using a Memory Management Unit (MMU) to translate processor-issued virtual addresses into physical addresses for cache and main memory, using disk storage to extend the effective capacity of the memory system.

<p>A system architecture using a Memory Management Unit (MMU) to translate processor-issued virtual addresses into physical addresses for cache and main memory, using disk storage to extend the effective capacity of the memory system.</p>
35
New cards

Translation Lookaside Buffer (TLB)

A high-speed, associative-mapped hardware cache within the MMU that stores recently referenced virtual-to-physical address translation entries (virtual page numbers, control bits, and physical page frames) to accelerate address translation.

<p>A high-speed, associative-mapped hardware cache within the MMU that stores recently referenced virtual-to-physical address translation entries (virtual page numbers, control bits, and physical page frames) to accelerate address translation.</p>
36
New cards

Memory-Mapped I/O

An I/O arrangement where I/O device registers share the same address space as main memory, allowing any standard memory-access machine instruction to transfer data to or from an I/O device.

37
New cards

Program-Controlled I/O

A synchronization method in which the processor continuously and repeatedly inspects (polls) a status flag in an I/O interface to determine when the device is ready for data transfer.

38
New cards

Interrupt

A hardware signal sent from an I/O device to the processor over an interrupt-request line to alert the processor that the device requires service, allowing the processor to execute other tasks in the interim.

39
New cards

Interrupt Service Routine (ISR)

The specific software routine executed by the processor in response to an accepted interrupt request from an I/O device.

40
New cards

Interrupt Latency

The total delay between the time an interrupt request is received by the processor and the start of execution of the corresponding interrupt service routine.

41
New cards

Privilege Exception

A specialized interrupt generated when an unauthorized attempt is made to execute a privileged instruction (such as changing the processor priority in the status register) while in user mode.

42
New cards

Polling Scheme (Interrupt Handling)

A method to resolve multiple interrupt sources where the processor sequentially reads the status registers of I/O devices, with priority determined strictly by the order in which devices are inspected.

43
New cards

Daisy Chain Scheme

A hardware arbitration connection where devices share a common interrupt-request line, and an interrupt-acknowledge (INTA) signal propagates serially through the devices, granting priority to the device electrically closest to the processor.

44
New cards

Open-Collector Interrupt Line

A hardware bus configuration where multiple devices attach to an active-low interrupt line (INTR‾\overline{\text{INTR}}) via ground switches with a pull-up resistor connected to VddV_{dd}, producing a wired-OR function: INTR=INTR1+⋯+INTRn\text{INTR} = \text{INTR}_1 + \dots + \text{INTR}_n.

<p>A hardware bus configuration where multiple devices attach to an active-low interrupt line ($$\overline{\text{INTR}}$$) via ground switches with a pull-up resistor connected to $$V_{dd}$$, producing a wired-OR function: $$\text{INTR} = \text{INTR}_1 + \dots + \text{INTR}_n$$.</p>
45
New cards

Direct Memory Access (DMA)

A hardware feature where a dedicated DMA controller executes block data transfers directly between an I/O device and main memory without continuous instruction processing by the CPU.

46
New cards

DMA Controller Registers

Dedicated registers within a DMA controller including a Starting Address register, a Word Count register, and a Status and Control register with fields for R/W‾\text{R}/\overline{\text{W}} (bit 11), Done (bit 00), Interrupt Enable (bit 3030), and Interrupt Request (bit 3131).

<p>Dedicated registers within a DMA controller including a Starting Address register, a Word Count register, and a Status and Control register with fields for $$\text{R}/\overline{\text{W}}$$ (bit $$1$$), Done (bit $$0$$), Interrupt Enable (bit $$30$$), and Interrupt Request (bit $$31$$).</p>
47
New cards

Cycle Stealing

A DMA operating technique in which the DMA controller temporarily 'steals' individual memory access cycles on the bus from the processor to transfer single words in an interwoven fashion.

48
New cards

Burst Mode (Block Mode)

A DMA transfer mode where the DMA controller is given exclusive control of the bus to transfer an entire block of data contiguously to or from main memory without relinquishing the bus.

49
New cards

Bus Master

The device (processor or DMA controller) that is currently authorized to initiate data transfers on the bus by issuing address and control signals.

50
New cards

Bus Arbitration

The procedure by which the next device to become the bus master is selected and bus mastership is formally transferred, implemented either centrally or in a distributed manner.

51
New cards

Distributed Bus Arbitration

A decentralized bus arbitration scheme where requesting devices transmit their identifier bits onto shared arbitration lines, compare the logical-OR result with their own ID from MSB to LSB, and withdraw lower-order bits upon detecting a difference until the highest-ID device wins.

<p>A decentralized bus arbitration scheme where requesting devices transmit their identifier bits onto shared arbitration lines, compare the logical-OR result with their own ID from MSB to LSB, and withdraw lower-order bits upon detecting a difference until the highest-ID device wins.</p>
52
New cards

Synchronous Bus

A bus architecture in which all bus activities and data transfers are synchronized by a shared, periodic clock line, executing fixed-length bus cycles.

53
New cards

Asynchronous Bus

A clockless bus architecture that relies on full handshake signaling (Master-ready and Slave-ready) to coordinate data transfers and automatically accommodate varying device speeds.

<p>A clockless bus architecture that relies on full handshake signaling (Master-ready and Slave-ready) to coordinate data transfers and automatically accommodate varying device speeds.</p>