User Tools

Site Tools


buzzword

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
buzzword [2018/12/05 15:53]
juang
buzzword [2019/09/20 13:09] (current)
juang
Line 63: Line 63:
   * Error Correcting Codes (ECC)   * Error Correcting Codes (ECC)
  
-===== Lecture 2 (20.09 ​Wed.) =====+===== Lecture 2 (20.09 ​Thu.) =====
   * Rowhammer   * Rowhammer
   * Memory reliability   * Memory reliability
Line 864: Line 864:
   * Registers of thread ID   * Registers of thread ID
   * Warp-based SIMD vs. Traditional SIMD   * Warp-based SIMD vs. Traditional SIMD
-  * Control flow path 
-  * Branch divergence 
-  * SIMD utilization 
   * GPGPU programming   * GPGPU programming
   * Inherent parallelism   * Inherent parallelism
Line 879: Line 876:
   * Transparent scalability   * Transparent scalability
   * Memory hierarchy   * Memory hierarchy
-  * CUDA programming language 
   * Indexing and memory access   * Indexing and memory access
   * Streaming multiprocessor (SM)   * Streaming multiprocessor (SM)
-  * Streaming processor (cuda core)+  * Streaming processor (Vector lane)
   * Occupancy   * Occupancy
   * Memory coalescing   * Memory coalescing
Line 908: Line 904:
   * Padding   * Padding
   * Chai benchmark suite   * Chai benchmark suite
 +
 +===== Lecture 22 (6.12 Thu.) =====
 +  * Persistent memory
 +  * Crash consistency
 +  * Checkpointing
 +  * Flynn´s taxonomy of computers
 +  * Parallelism
 +  * Performance
 +  * Power consumption
 +  * Cost efficiency
 +  * Dependability
 +  * Instruction level parallelism
 +  * Data parallelism
 +  * Task level parallelism
 +  * Multiprocessor
 +  * Loosely coupled
 +  * Tightly coupled
 +  * Shared global memory address space
 +  * Shared memory synchronization
 +  * Cache coherence
 +  * Memory consistency
 +  * Shared resource management
 +  * Interconnects
 +  * Programming issues in tightly coupled multiprocessor
 +  * Sublinear speedup
 +  * Linear speedup
 +  * Superlinear speedup
 +  * Unfair comparison
 +  * Cache/​memory effect
 +  * Utilization
 +  * Redundancy
 +  * Efficiency
 +  * Amdahl'​s law
 +  * Bottlenecks in parallel portion
 +  * Ordering of operations
 +  * Sequential consistency
 +  * Weaker memory consistency
 +  * Memory fence instructions
 +  * Higher performance
 +  * Burden on the programmer
 +  * Coherence scheme
 +  * Valid/​invalid
 +  * Write propagation
 +  * Write serialization
 +  * Update vs. Invalid
 +  * Cache coherence
 +  * Snoopy bus
 +  * Directory
 +  * Directory optimizations
 +  * Directory bypassing
 +  * Snoopy cache
 +  * Shared bus
 +  * VI protocol
 +  * MSI (Modified, Shared, Invalid)
 +  * Exclusive state
 +  * MESI (Modified, Exclusive, Shared, Invalid)
 +  * Illinois Protocol (MESI)
 +  * Broadcast
 +  * Bus request
 +  * Downgrade
 +  * Upgrade
 +  * Snoopy invalidation
 +  * Cache-to-cache transfer
 +  * Writeback
 +  * MOESI (Modified, Owned, Exclusive, Shared, Invalid)
 +  * Directory coherence
 +  * Race conditions
 +  * Totally-ordered interconnect
 +  * Directory-based protocols
 +  * Set inclusion test
 +  * Linked list
 +  * Bloom filters
 +  * Contention resolution
 +  * Ping-ponging
 +  * Synchronization
 +  * Shared-data-structure
 +  * Token Coherence
 +  * Virtual bus
 +
 +===== Lecture 23 (12.12 Wed.) =====
 +  * Interconnection Network, Interconnect
 +  * Topology
 +  * Routing
 +  * Buffering and Flow Control
 +  * Switch/​Router
 +  * Channel
 +  * Wire
 +  * Packet
 +  * Path
 +  * Bus
 +  * Mesh, 2D Mesh
 +  * Throttling
 +  * Oversubscription
 +  * Network Interface
 +  * Link
 +  * Node
 +  * Message
 +  * Flit
 +  * Direct/​Indirect Network
 +  * Radix
 +  * Regular/​Irregular Topology
 +  * Routing Distance
 +  * Diameter
 +  * Bisection Bandwidth
 +  * Congestion
 +  * Blocking/​non-blocking Interconnect
 +  * Crossbar
 +  * Ring
 +  * Tree
 +  * Omega
 +  * Hypercube
 +  * Torus
 +  * Butterfly
 +  * Arbitration
 +  * Point-to-Point
 +  * Multistage Network
 +  * Hop
 +  * Circuit Switching
 +  * Packet Switching
 +  * Tree saturation
 +  * Deadlock
 +  * Circular dependency
 +  * Oblivious Routing
 +  * Adaptive Routing
 +  * Packet Format
 +  * Header
 +  * Payload
 +  * Error Code
 +  * Virtual Channel Flow Control
 +
 +===== Lecture 24 (13.12 Thu.) =====
 +  * Load latency curve
 +  * Performance of interconnection networks
 +  * On-chip networks
 +  * Difference between off-chip and on-chip networks
 +  * Network buffers
 +  * Efficient routing
 +  * Advantages of on-chip interconnects
 +  * Pin constraints
 +  * Wiring resources
 +  * Disadvantages of on-chip interconnects
 +  * Energy/​power constraint
 +  * Tradeoffs of interconnect design
 +  * Buffers in NoC routers
 +  * Bufferless routing
 +  * Flit-level routing
 +  * Deflection routing
 +  * Buffer and link energy consumption
 +  * Self-throttling
 +  * Livelock freedom problem
 +  * Golden packet for livelock freedom
 +  * Reassembly buffers
 +  * Packet retransmission
 +  * Packet scheduling
buzzword.1544021623.txt.gz · Last modified: 2019/02/12 17:33 (external edit)