This post is a new episode in a miniseries focused on modeling the workings of a CPU to use for generating optimal code. This post focuses on taking a sequence of instructions and simulating their results while respecting the latency of each instruction execution and data dependencies between instructions.
Articles tagged with Miniseries
SIMD and Graphs: Partitioning Graphs into data-dependency levels Building
This post is a new episode in a miniseries focused on SIMD instructions. This second post focuses on fusing common single operations across multiple data
SIMD and Graphs: Graph Matching Building
This post is a new episode in a miniseries focused on SIMD instructions. This first post focuses on matching points in the compute graph where we can combine individual instructions to form SIMD instructions.