PROJECTENGRAM

COURSE OVERVIEW & ARCHITECTURE FOUNDATIONS

Module 00: Course Overview & Architecture Foundations

Tags: #◇Computer Science #◇CSARCH2 #◇Computer Architecture #◇Hardware Modeling #◇Course Overview & Architecture Foundations


◇Overview

Computer Systems Architecture 2 (CSARCH2) explores the critical bridge between software specifications and physical hardware execution. This course analyzes the internal design and mathematical mechanics of modern computing systems, focusing on low-level arithmetic logic unit (ALU) algorithms, data representation standards, processor datapath and control unit microprogramming, and memory hierarchy optimization. Understanding these architectural foundations enables computer scientists to reason about execution efficiency, hardware resource constraints, and hardware-software co-design principles.

◇Key Definitions

  • Computer Architecture: The conceptual structure and functional behavior of a computer system as seen by the assembly-level programmer, encompassing the Instruction Set Architecture (ISA), addressing modes, register formats, and data representations.
  • Computer Organization (Microarchitecture): The operational units and physical interconnections that implement the architectural specifications, including bus topologies, ALU adder circuits, pipeline stages, and control logic implementations.
  • Hardware Implementation: The specific physical realization of microarchitectural components using silicon semiconductor processes, transistor lithography (e.g., CMOS, FinFET, GAAFET), and circuit layout topologies.
  • Stored-Program Concept: The architectural principle where both program instructions and user data reside together in shared, addressable primary memory, enabling arbitrary execution branching and dynamic code loading.
  • Moore's Law: An empirical observation by Gordon Moore stating that the number of transistors packed onto a dense integrated circuit doubles approximately every 18 to 24 months.
  • Dennard Scaling: The principle of MOSFET scaling asserting that as transistors become smaller, their power density remains constant because operating voltage and current scale downward proportionally with physical dimensions.
  • Power Wall: The practical constraint in modern microprocessors where dynamic power dissipation (P=C⋅V2⋅fP = C \cdot V^2 \cdot f) and thermal limits prevent further increases in single-core clock frequencies, forcing industry transitions toward multicore and domain-specific architectures.

◇Theoretical Framework / Core Concepts

1. The Architectural Hierarchy: Architecture vs. Organization vs. Implementation

In computer systems engineering, a clear distinction is maintained between the layers of abstraction:

『』
TEXT
+-----------------------------------------------------------------------+
| Application Software & High-Level Languages (C, Python, Java, Rust)   |
+-----------------------------------------------------------------------+
                                  |
                                  v
+-----------------------------------------------------------------------+
| Computer Architecture (ISA): Registers, Instructions, Addressing Modes|
+-----------------------------------------------------------------------+
                                  |
                                  v
+-----------------------------------------------------------------------+
| Computer Organization (Microarchitecture): Single-Bus Datapath,       |
| Pipelining, Control Store, Cache Mapping, ALU Hardware Engines        |
+-----------------------------------------------------------------------+
                                  |
                                  v
+-----------------------------------------------------------------------+
| Physical Hardware Implementation: CMOS Gates, FinFETs, 3nm Silicon    |
+-----------------------------------------------------------------------+
  1. Architecture Level (What the machine does):

    • Visible to the compiler writer and assembly programmer.
    • Includes the instruction set, opcode formats, operand types, memory addressing modes, and architectural register sets (e.g., EAX, EBX, PC, FLAGS).
    • Guarantees backward binary compatibility across multiple chip generations (e.g., x86-64, ARMv8, RISC-V).
  2. Organization Level (How the machine executes it):

    • Invisible to user-level code.
    • Includes the number of internal data buses, pipeline depth, branch prediction mechanisms, cache associativity, and microcode control stores.
    • Different microarchitectures can execute the exact same ISA with vastly different performance profiles.
  3. Implementation Level (The physical substrate):

    • Pertains to semiconductor device physics, lithography scale (e.g., 5 nm, 3 nm, 2 nm GAAFET), transistor switching delays, voltage thresholds, and thermal dissipation packaging.

2. The Stored-Program Paradigm: Von Neumann vs. Harvard

The stored-program concept forms the bedrock of universal computation. Prior to this innovation, computers were programmed by manually rewiring patch cables or physically altering hardware switches (e.g., ENIAC).

『』
TEXT
Von Neumann Architecture:
+-------------------+       Unified System Bus       +-------------------+
|                   | <============================> |  Unified Memory   |
|        CPU        |   (Instructions & Data Share   |   (Instructions   |
| (Control + ALU)   |    Same Address/Data Bus)      |      + Data)      |
+-------------------+                                +-------------------+

Harvard Architecture:
+-------------------+    Instruction Bus (Fetch)     +-------------------+
|                   | =============================> |  Instruction RAM  |
|        CPU        |                                +-------------------+
| (Control + ALU)   |       Data Bus (Read/Write)    +-------------------+
|                   | <============================> |     Data RAM      |
+-------------------+                                +-------------------+
  • Von Neumann Model:
    • Uses a unified memory address space for both machine instructions and application data.
    • A single system bus (address/data) handles both instruction fetch and operand read/write operations.
    • Von Neumann Bottleneck: CPU execution throughput is fundamentally constrained because instructions and data cannot be accessed simultaneously across the single shared bus.
  • Harvard Model:
    • Uses physically separated memory banks and buses for instructions and data.
    • Allows simultaneous instruction fetch and data operand read/write within the same clock cycle.
    • Modern Modified Harvard Organization: High-performance processors adopt a modified Harvard architecture at Level 1 (split L1 Instruction Cache and L1 Data Cache) while maintaining a unified Von Neumann memory space at Level 2/L3 cache and main DRAM.

3. Technological Evolution & Semiconductor Scaling

The evolution of digital electronic computers is categorized across distinct hardware generations:

GenerationEraActive Switching ElementKey Milestone SystemsTypical Switching Time
First1940–1955Vacuum TubesENIAC, EDVAC, UNIVAC IMilliseconds (10−3 s10^{-3}\text{ s})
Second1955–1965Discrete TransistorsIBM 7090, CDC 6600Microseconds (10−6 s10^{-6}\text{ s})
Third1965–1975Integrated Circuits (SSI / MSI)IBM System/360, PDP-8Nanoseconds (10−9 s10^{-9}\text{ s})
Fourth1975–PresentVLSI / ULSI MicroprocessorsIntel 4004, 8086, Pentium, CoreSub-nanoseconds (<10−9 s< 10^{-9}\text{ s})
FifthPresent–Future3D Heterogeneous & GAAFETsApple M-Series, AMD Zen, Tensor ProcessorsPicoseconds (10−12 s10^{-12}\text{ s})

4. Limits of Scaling: Dennard Scaling Breakdown and the Power Wall

For decades, Moore's Law was paired with Dennard Scaling. If the linear dimension of a transistor is scaled by factor κ<1\kappa < 1 (e.g., 0.7×0.7\times):

  • Transistor area scales by κ2≈0.5×\kappa^2 \approx 0.5\times (doubling density).
  • Capacitance CC scales by κ\kappa.
  • Supply voltage VddV_{dd} scaled by κ\kappa.
  • Switching delay scaled by κ\kappa (allowing frequency ff to increase by 1/κ1/\kappa).

Dynamic power dissipation is modeled as:
Pdynamic=α⋅C⋅Vdd2⋅fP_{\text{dynamic}} = \alpha \cdot C \cdot V_{dd}^2 \cdot f

When Dennard scaling held, power density remained flat:
Power Density=PArea≈κ⋅(κV)2⋅(f/κ)κ2=1\text{Power Density} = \frac{P}{\text{Area}} \approx \frac{\kappa \cdot (\kappa V)^2 \cdot (f/\kappa)}{\kappa^2} = 1

Around 2005, sub-threshold leakage current (Ileakage∝e−Vth/kTI_{\text{leakage}} \propto e^{-V_{th}/kT}) prevented further lowering of supply voltage VddV_{dd} without exponential increases in static leakage power (Pstatic=Vdd⋅IleakageP_{\text{static}} = V_{dd} \cdot I_{\text{leakage}}). The inability to dissipate the resulting heat gave rise to the Power Wall, terminating the era of aggressive single-core clock frequency scaling and accelerating multi-core parallelism.

◇Worked Examples / Calculations / Hardware Traces

Example 1: Calculating Dynamic Power Scaling Under Clock Frequency Adjustments

Problem: A processor core operates at a clock frequency of 3.6 GHz3.6\text{ GHz} with a supply voltage of 1.2 V1.2\text{ V}, consuming 65 W65\text{ W} of dynamic power. If the voltage is scaled down to 0.95 V0.95\text{ V} to manage thermals and the clock frequency is reduced to 2.8 GHz2.8\text{ GHz}, calculate:

  1. The new dynamic power consumption.
  2. The percentage reduction in dynamic power.

Solution:
Using the proportional dynamic power relation:
P2=P1×(V2V1)2×(f2f1)P_2 = P_1 \times \left(\frac{V_2}{V_1}\right)^2 \times \left(\frac{f_2}{f_1}\right)

Substitute the given values:
P2=65 W×(0.95 V1.20 V)2×(2.8 GHz3.6 GHz)P_2 = 65\text{ W} \times \left(\frac{0.95\text{ V}}{1.20\text{ V}}\right)^2 \times \left(\frac{2.8\text{ GHz}}{3.6\text{ GHz}}\right)

P2=65×(0.79167)2×(0.77778)P_2 = 65 \times (0.79167)^2 \times (0.77778)
P2=65×0.62674×0.77778≈31.68 WP_2 = 65 \times 0.62674 \times 0.77778 \approx 31.68\text{ W}

The percentage power reduction is:
ΔP=65 W−31.68 W65 W×100%=33.3265×100%≈51.26%\Delta P = \frac{65\text{ W} - 31.68\text{ W}}{65\text{ W}} \times 100\% = \frac{33.32}{65} \times 100\% \approx 51.26\%

Example 2: Transistor Density Scaling via Moore's Law

Problem: A microprocessor fabricated in year T0T_0 contains 4 billion transistors. Assuming historical Moore's Law scaling of doubling transistor count every 24 months, calculate the expected transistor count after 8 years.

Solution:
Transistors(t)=N0⋅2t/τ\text{Transistors}(t) = N_0 \cdot 2^{t / \tau}
where N0=4×109N_0 = 4 \times 10^9, t=8 years=96 monthst = 8\text{ years} = 96\text{ months}, and τ=24 months\tau = 24\text{ months}.

Doubling periods k=9624=4\text{Doubling periods } k = \frac{96}{24} = 4
N(8 years)=4×109×24=4×109×16=64×109=64 Billion transistorsN(8\text{ years}) = 4 \times 10^9 \times 2^4 = 4 \times 10^9 \times 16 = 64 \times 10^9 = 64\text{ Billion transistors}

◇Complexity Analysis / Common Pitfalls

  • Confusing ISA with Microarchitecture: A frequent misconception is assuming that the x86-64 instruction set dictates a specific internal pipeline or bus width. The ISA defines the software interface contract, whereas microarchitectures (e.g., Intel Alder Lake vs AMD Zen 4) implement completely different pipelines, execution units, and control logic while executing identical binary instructions.
  • Ignoring Leakage Power at Nanometer Nodes: Students often assume dynamic switching power is the sole contributor to thermal dissipation. In sub-7nm fabrication processes, static leakage power can account for 30% to 50%30\%\text{ to }50\% of total chip power dissipation if unused silicon domains are not actively power-gated.
  • Von Neumann Bottleneck Misinterpretation: The Von Neumann bottleneck is not a limitation in ALU computational throughput, but rather the memory-bus bandwidth constraint caused by sharing a single path for instruction fetching and data transfers.

◇References & Navigation

CONFIRMATION // 理解度の確認

ACTIVE RECALL VERIFICATION

Select an answer to verify conceptual comprehension and reveal the technical rationale.

Q1

Which of the following architectural features is part of the computer architecture rather than computer organization?

Q2

What is the fundamental cause of the Von Neumann bottleneck?

Q3

Why did Dennard Scaling cease to hold true around the mid-2000s?

Q4

In a pure Harvard architecture, what design feature prevents the Von Neumann bottleneck?

Q5

If the supply voltage of a microprocessor core is reduced by 20%20\% while maintaining the same clock frequency, what is the approximate percentage reduction in dynamic power?

Course Overview & Architecture Foundations | PROJECT ENGRAM