buzzword
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
buzzword [2014/01/17 19:19] rachata |
buzzword [2015/01/14 19:24] rachata |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== Buzzwords ====== | ====== Buzzwords ====== | ||
| - | Buzzwords are terms that are mentioned during lecture which are particularly important to understand thoroughly. This page tracks the buzzwords for each of the lectures and can be used as a reference for finding gaps in your understanding of course material. | + | Buzzwords are terms that are mentioned during lecture which are particularly important to understand thoroughly. This page tracks the buzzwords for each of the lectures and can be used as a reference for finding gaps in your understanding of course material. |
| - | + | ||
| - | ===== Lecture 1 (1/13 Mon.) ===== | + | |
| + | ===== Lecture 1 (1/12 Mon.) ===== | ||
| * Level of transformation | * Level of transformation | ||
| * Algorithm | * Algorithm | ||
| Line 10: | Line 9: | ||
| * Compiler | * Compiler | ||
| * Cross abstraction layers | * Cross abstraction layers | ||
| - | * Expose an interface | ||
| * Tradeoffs | * Tradeoffs | ||
| * Caches | * Caches | ||
| - | * Multi-thread | + | * DRAM/memory controller |
| - | * Multi-core | + | * DRAM banks |
| - | * Unfairness | + | |
| - | * DRAM controller/Memory controller | + | |
| - | * Memory hog | + | |
| * Row buffer hit/miss | * Row buffer hit/miss | ||
| * Row buffer locality | * Row buffer locality | ||
| - | * Streaming access/ Random access | + | * Unfairness |
| - | * DRAM refresh | + | * Memory performance hog |
| - | * Retention time | + | * Shared DRAM memory system |
| - | * Profiling DRAM retention time | + | * Streaming access vs. random access |
| + | * Memory scheduling policies | ||
| + | * Scheduling priority | ||
| + | * Retention time of DRAM | ||
| + | * Process variation | ||
| + | * Retention time profile | ||
| * Power consumption | * Power consumption | ||
| - | * Wimpy cores | ||
| * Bloom filter | * Bloom filter | ||
| - | * Pros/Cons | + | * Hamming code |
| - | * False Positive | + | * Hamming distance |
| - | * Simulation | + | * DRAM row hammer |
| - | * Memory performance attacks | + | |
| - | * RTL design | + | |
| - | ===== Lecture 2 (1/15 Wed.) ===== | + | ===== Lecture 2 (1/14 Wed.) ===== |
| - | + | ||
| - | * Optimizing for energy/ Optimizing for the performance | + | |
| - | * Generally you should optimize for the users | + | |
| - | * state-of-the-art | + | |
| - | * RTL Simulation | + | |
| - | * Long, slow and can be costly | + | |
| - | * High level simulation | + | |
| - | * What should be employed? | + | |
| - | * Important to get the idea of how they are implemented in RTL | + | |
| - | * Allows designer to filter out techniques that do not work well | + | |
| - | * Design points | + | |
| - | * Design processors to meet the design points | + | |
| - | * Software stack | + | |
| - | * Design decisions | + | |
| - | * Datacenters | + | |
| - | * MIPS R2000 | + | |
| - | * What are architectural techniques that improve the performance of a processor over MIPS 2000 | + | |
| * Moore's Law | * Moore's Law | ||
| + | * Algorithm --> step-by-step procedure to solve a problem | ||
| * in-order execution | * in-order execution | ||
| * out-of-order execution | * out-of-order execution | ||
| Line 65: | Line 46: | ||
| * Scaling issue | * Scaling issue | ||
| * Transister are getting smaller | * Transister are getting smaller | ||
| + | * Key components of a computer | ||
| + | * Design points | ||
| + | * Design processors to meet the design points | ||
| + | * Software stack | ||
| + | * Design decisions | ||
| + | * Datacenters | ||
| * Reliability problems that cause errors | * Reliability problems that cause errors | ||
| * Analogies from Kuhn's "The Structure of Scientific Revolutions" (Recommended book) | * Analogies from Kuhn's "The Structure of Scientific Revolutions" (Recommended book) | ||
| Line 72: | Line 59: | ||
| * Components of a computer | * Components of a computer | ||
| * Computation | * Computation | ||
| - | * Communication | + | * Communication |
| - | * Storage | + | * Storage |
| * DRAM | * DRAM | ||
| * NVRAM (Non-volatile memory): PCM, STT-MRAM | * NVRAM (Non-volatile memory): PCM, STT-MRAM | ||
| - | * Storage (Flash/Harddrive) | + | * Storage (Flash/Harddrive) |
| * Von Neumann Model (Control flow model) | * Von Neumann Model (Control flow model) | ||
| * Stored program computer | * Stored program computer | ||
| - | * Properties of Von Neumann Model: Stored program, sequential instruction processing | + | * Properties of Von Neumann Model: Stored program, sequential instruction processing |
| - | * Unified memory | + | * Unified memory |
| - | * When does an instruction is being interpreted as an instruction (as oppose to a datum)? | + | * When does an instruction is being interpreted as an instruction (as oppose to a datum)? |
| - | * Program counter | + | * Program counter |
| - | * Examples: x86, ARM, Alpha, IBM Power series, SPARC, MIPS | + | * Examples: x86, ARM, Alpha, IBM Power series, SPARC, MIPS |
| * Data flow model | * Data flow model | ||
| * Data flow machine | * Data flow machine | ||
| - | * Data flow graph | + | * Data flow graph |
| * Operands | * Operands | ||
| * Live-outs/Live-ins | * Live-outs/Live-ins | ||
| - | * DIfferent types of data flow nodes (conditional/relational/barrier) | + | * DIfferent types of data flow nodes (conditional/relational/barrier) |
| * How to do transactional transaction in dataflow? | * How to do transactional transaction in dataflow? | ||
| - | * Example: bank transactions | + | Example: bank transactions |
| * Tradeoffs between control-driven and data-driven | * Tradeoffs between control-driven and data-driven | ||
| * What are easier to program? | * What are easier to program? | ||
| Line 108: | Line 95: | ||
| * Multiple instructions at a time | * Multiple instructions at a time | ||
| * Out-of-order executions | * Out-of-order executions | ||
| - | * etc. | + | * etc. |
| - | * Design techniques | + | * Design techniques |
| - | * Adder implementation (Bit serial, ripple carry, carry lookahead) | + | * Adder implementation (Bit serial, ripple carry, carry lookahead) |
| - | * Connection machine (an example of a machine that use bit serial to tradeoff latency for more parallelism) | + | * Connection machine (an example of a machine that use bit serial to tradeoff latency for more parallelism) |
| * Microprocessor: ISA + uArch + circuits | * Microprocessor: ISA + uArch + circuits | ||
| * What are a part of the ISA? Instructions, memory, etc. | * What are a part of the ISA? Instructions, memory, etc. | ||
| Line 117: | Line 104: | ||
| * What are not a part of the ISA? (what goes inside: uArch techniques) | * What are not a part of the ISA? (what goes inside: uArch techniques) | ||
| * Things that are not suppose to be visible to the programmer/software but typically make the processor faster and/or consumes less power and/or less complex | * Things that are not suppose to be visible to the programmer/software but typically make the processor faster and/or consumes less power and/or less complex | ||
| - | |||
| - | ===== Lecture 3 (1/17 Fri.) ===== | ||
| - | |||
| - | * Design tradeoffs | ||
| - | * Macro Architectures | ||
| - | * Reconfiguribility vs. specialized designs | ||
| - | * Parallelism (instructions, data parallel) | ||
| - | * Uniform decode (Example: Alpha) | ||
| - | * Steering bits (Sub-opcode) | ||
| - | * 0,1,2,3 address machines | ||
| - | * Stack machine | ||
| - | * Accumulator machine | ||
| - | * 2-operand machine | ||
| - | * 3-operand machine | ||
| - | * Tradeoffs between 0,1,2,3 address machines | ||
| - | * Instructions/Opcode/Operade specifiers (i.e. addressing modes) | ||
| - | * Simply vs. complex data type (and their tradeoffs) | ||
| - | * Semantic gap | ||
| - | * Translation layer | ||
| - | * Addressability | ||
| - | * Byte/bit addressable machines | ||
| - | * Virtual memory | ||
| - | * Big/little endian | ||
| - | * Benefits of having registers (data locality) | ||
| - | * Programmer visible (Architectural) state | ||
| - | * Programmers can access this directly | ||
| - | * What are the benefits? | ||
| - | * Microarchitectural state | ||
| - | * Programmers cannot access this directly | ||
| - | * Evolution of registers (from accumulators to registers) | ||
| - | * Different types of instructions | ||
| - | * Control instructions | ||
| - | * Data instructions | ||
| - | * Operation instructions | ||
| - | * Addressing modes | ||
| - | * Tradeoffs (complexity, flexibility, etc.) | ||
| - | * Orthogonal ISA | ||
| - | * Addressing modes that are orthogonal to instructino types | ||
| - | * Vectors vs. non vectored interrupts | ||
| - | * Complex vs. simple instructions | ||
| - | * Tradeoffs | ||
| - | * RISC vs. CISC | ||
| - | * Tradeoff | ||
| - | * Backward compatibility | ||
| - | * Performance | ||
| - | * Optimization opportunity | ||
| - | |||
buzzword.txt · Last modified: 2015/04/27 18:20 by rachata
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 3.0 Unported
