Tag
coalescing
- Aug 27, 2026 Stride, Misalignment, and the Cost of a Bad Layout How stride and alignment interact to add sectors to every warp request, why a row-major array accessed by column collapses bandwidth, and what a shared-memory transpose costs in return. gpu computing
- May 13, 2026 Boundary Tags and Coalescing in a Free-List Heap How a heap finds the neighbours of a freed block using headers at both ends, why coalescing is necessary for reuse, and what the deferred variants cost in latency. memory systems
- May 4, 2025 Interrupt Moderation and Event Delivery at High Rates Why one interrupt per completed transfer collapses at high packet rates, how coalescing timers and counters bound the damage, and what a polled-mode driver gives up. computer architecture
- Mar 22, 2023 How a Warp Turns Thirty-Two Loads into Memory Transactions The request the memory system actually receives from a warp-wide load, why the unit of transfer is a 32-byte sector rather than a cache line, and how a partial write forces a read first. gpu computing
- Aug 3, 2022 Conservative Coalescing and the Conditions That Make It Safe Why merging the source and destination of a move can make a colorable graph uncolorable, and how the Briggs and George tests decide when the merge is guaranteed not to hurt. compilers
- Apr 6, 2022 Sector Counting and Why Cache Hit Rate Misleads How memory transactions are accounted in sectors, why a high hit rate can coexist with poor performance, and how to read the traffic counters that separate the two. gpu computing