<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Fierce &amp; Aggressive</title><link>https://bias92.github.io/en/</link><description>Recent content on Fierce &amp; Aggressive</description><generator>Hugo -- 0.147.0</generator><language>en</language><lastBuildDate>Thu, 03 Sep 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://bias92.github.io/en/index.xml" rel="self" type="application/rss+xml"/><item><title>Digital Logic Circuits</title><link>https://bias92.github.io/en/posts/digital-logic-circuits/</link><pubDate>Wed, 02 Sep 2026 00:00:00 +0000</pubDate><guid>https://bias92.github.io/en/posts/digital-logic-circuits/</guid><description>Lecture notes for Digital Logic Circuits based on Floyd: analog and digital quantities, logic levels, pulses and periodic waveforms, the clock and timing diagrams, NOT, AND and OR, the comparator, adder, encoder and decoder, registers and counters, and the tablet bottling system that ties the blocks together.</description></item><item><title>Signals and Systems</title><link>https://bias92.github.io/en/posts/signals-and-systems/</link><pubDate>Wed, 02 Sep 2026 00:00:00 +0000</pubDate><guid>https://bias92.github.io/en/posts/signals-and-systems/</guid><description>Lecture notes for Signals and Systems based on Soliman &amp;amp; Srinath: the definition of a signal, continuity and the value at a discontinuity, the rectangular pulse, continuous-time versus discrete-time, periodic signals and sinusoids, harmonics, and harmonically related complex exponentials.</description></item><item><title>01 Loop-Invariant Code Motion: From Loop Body to Preheader</title><link>https://bias92.github.io/en/posts/llvm-1-licm/</link><pubDate>Mon, 31 Aug 2026 00:00:00 +0000</pubDate><guid>https://bias92.github.io/en/posts/llvm-1-licm/</guid><description>LLVM LICM moves an invariant multiplication and addition from a loop body into its preheader. A C-to-IR diff shows how invariant operands, memory effects, and the zero-trip path determine whether hoisting is legal.</description></item><item><title>00 LLVM IR and the Compilation Pipeline: From C Code to Machine Code</title><link>https://bias92.github.io/en/posts/llvm-0-ir-pipeline/</link><pubDate>Tue, 25 Aug 2026 00:00:00 +0000</pubDate><guid>https://bias92.github.io/en/posts/llvm-0-ir-pipeline/</guid><description>Starting from the difference between interpreters, JITs, and AOT compilers, emit LLVM IR from C with clang, decode it, and follow the compilation pipeline down through assembly to an executable. Observe how optimization passes rewrite the IR via an -O0 vs -O1 diff, and record the optnone attribute that makes opt silently do nothing.</description></item><item><title>05 CUDA Concurrency: Streams, Async Copies, and Overlap</title><link>https://bias92.github.io/en/posts/cuda-5-concurrency/</link><pubDate>Sat, 22 Aug 2026 00:00:00 +0900</pubDate><guid>https://bias92.github.io/en/posts/cuda-5-concurrency/</guid><description>How data copies and kernel execution are placed in the same time window, explained in the order host and device memory, pinned memory, cudaMemcpyAsync, stream, and chunk.</description></item><item><title>04 CUDA Unified Memory: Virtual Address, Placement, and Coherence</title><link>https://bias92.github.io/en/posts/cuda-4-unified-memory/</link><pubDate>Thu, 13 Aug 2026 00:00:00 +0000</pubDate><guid>https://bias92.github.io/en/posts/cuda-4-unified-memory/</guid><description>How the CPU and GPU share one memory allocation, explained through virtual addresses, data placement and migration, synchronization, and cache coherence, and applied to the actual device attributes of Jetson AGX Orin.</description></item><item><title>6.5930 L02 - From Einsum to DNN Workloads</title><link>https://bias92.github.io/en/posts/mit-6.5930-l02/</link><pubDate>Sat, 18 Jul 2026 00:00:00 +0900</pubDate><guid>https://bias92.github.io/en/posts/mit-6.5930-l02/</guid><description>Complete L02 notes: accelerator design methodology, tensors and Einsum, iteration spaces, memory traffic, compute intensity, Roofline analysis, CNN convolution, and mapping fully connected layers to GEMV/GEMM.</description></item><item><title>03 CUDA Shared Memory: Tiling, Bank Conflicts, and Reduction</title><link>https://bias92.github.io/en/posts/cuda-3-shared-memory/</link><pubDate>Tue, 14 Jul 2026 00:00:00 +0000</pubDate><guid>https://bias92.github.io/en/posts/cuda-3-shared-memory/</guid><description>Global memory coalescing, shared memory tiling, bank conflicts with padding and swizzle, occupancy, warp divergence and predication, and four stages of reduction, explained by how the code works.</description></item><item><title>02 CUDA C Basics</title><link>https://bias92.github.io/en/posts/cuda-c-basics/</link><pubDate>Fri, 29 May 2026 00:00:00 +0000</pubDate><guid>https://bias92.github.io/en/posts/cuda-c-basics/</guid><description>The CUDA C execution model from the ground up: the compilation pipeline, why the 3-stage memory transfer is the bottleneck (with bandwidth numbers), how thread/block/grid schedule onto SM/warp/lane, occupancy, and kernel launch syntax.</description></item><item><title>01 NVIDIA GPU Architecture Genealogy: Tesla to Rubin</title><link>https://bias92.github.io/en/posts/cuda-2-gpu-genealogy/</link><pubDate>Fri, 22 May 2026 00:00:00 +0000</pubDate><guid>https://bias92.github.io/en/posts/cuda-2-gpu-genealogy/</guid><description>One line from Tesla (2006) to Rubin (2026): how the NVIDIA SM stayed the same (SIMT, warp = 32, block per SM) while accreting specialized accelerators, how the Tensor Core evolved across five generations, why the consumer and datacenter lines split, and why &amp;lsquo;Rubin&amp;rsquo; is a platform, not just a GPU.</description></item><item><title>00 GPU Architecture Primer: The Tesla Foundation</title><link>https://bias92.github.io/en/posts/cuda-0-gpu-architecture/</link><pubDate>Fri, 15 May 2026 00:00:00 +0000</pubDate><guid>https://bias92.github.io/en/posts/cuda-0-gpu-architecture/</guid><description>Before CUDA C: the Tesla unified architecture (G80/GT200) from the 2008 IEEE Micro paper. The graphics-to-compute data path (Input Assembler, work distribution, SPA, TPC, SM/SP, SFU/LSU, ROP, DRAM), how the warp and SIMT were born in hardware, clock domains, and how every structure becomes a CUDA term.</description></item><item><title>JetPack 6.2.2 Flash Troubleshooting: AMD USB Incompatibility and the chroot Solution</title><link>https://bias92.github.io/en/posts/jetson-flash-troubleshooting/</link><pubDate>Thu, 19 Mar 2026 00:00:00 +0000</pubDate><guid>https://bias92.github.io/en/posts/jetson-flash-troubleshooting/</guid><description>Documenting the root cause of the tegrarcm_v2 USB write timeout on AMD hosts when flashing a Jetson AGX Orin, and a chroot-based workaround using an Intel laptop with limited RAM.</description></item><item><title>6.5940 L01: Introduction and Overview</title><link>https://bias92.github.io/en/posts/6.5940-lec01-introduction/</link><pubDate>Sun, 15 Mar 2026 00:00:00 +0000</pubDate><guid>https://bias92.github.io/en/posts/6.5940-lec01-introduction/</guid><description>Notes on MIT 6.5940 (Song Han) Lecture 1. From why DNN efficiency matters through Model Compression, Quantization (AWQ/SmoothQuant/RTN), Sparsity, Edge AI, VLM/VILA, and Hardware Trend.</description></item><item><title>6.5930 L01 - Introduction and Applications</title><link>https://bias92.github.io/en/posts/mit-6.5930-l01/</link><pubDate>Sat, 07 Mar 2026 00:00:00 +0000</pubDate><guid>https://bias92.github.io/en/posts/mit-6.5930-l01/</guid><description>&lt;h2 id="a-word-from-ilya-sutskever-l01-3">A Word from Ilya Sutskever (L01-3)&lt;/h2>
&lt;p>&lt;img alt="Ilya Sutskever Quote" loading="lazy" src="https://bias92.github.io/posts/mit-6.5930-l01/images/L01-3-ilya-quote.png">&lt;/p>
&lt;p>Early in the lecture there is a quote from Ilya Sutskever.&lt;/p>
&lt;p>&amp;ldquo;Compute has been the oxygen of deep learning.&amp;rdquo;&lt;/p>
&lt;p>He said it at the 50th anniversary event for the ACM Turing Award in 2017. Good algorithms alone run nothing. Compute has to back them up. I read this sentence as the shortest answer to why MLSys is needed.&lt;/p>
&lt;p>Models keep changing. CNNs gave way to Transformers, and structures like MoE and Mamba are common now. Each shift shakes the model-side knowledge, but the problem of running models efficiently on real hardware does not go away. &amp;ldquo;AI-resistant career&amp;rdquo; sounds a bit grand, but I agree that MLSys is a field with staying power.&lt;/p></description></item><item><title>MIT 6.5930: Hardware Architecture for Deep Learning</title><link>https://bias92.github.io/en/posts/mit-6.5930-hardware-for-deep-learning/</link><pubDate>Thu, 05 Mar 2026 00:00:00 +0000</pubDate><guid>https://bias92.github.io/en/posts/mit-6.5930-hardware-for-deep-learning/</guid><description>MIT EECS 6.5930 by Prof. Vivienne Sze and Prof. Joel Emer, Hardware Architecture for Deep Learning</description></item><item><title>Opening Note</title><link>https://bias92.github.io/en/posts/hello-world/</link><pubDate>Sun, 02 Mar 2025 00:00:00 +0000</pubDate><guid>https://bias92.github.io/en/posts/hello-world/</guid><description>GPU Systems &amp;amp; Deep Learning Hardware</description></item></channel></rss>