täkō: A Polymorphic Cache Hierarchy for General-Purpose Optimization of Data Movement
cs.cmu.edu · 5,854 words · saved by 1 readers
N/A
täkō: A Polymorphic Cache Hierarchy for General-Purpose Optimization of Data Movement Brian C. Schwedock Piratach Yoovidhya Jennifer Seibert Nathan Beckmann Carnegie Mellon University Carnegie Mellon University Binghamton University Carnegie Mellon University bschwedo@andrew.cmu.edu piratacy@andrew.cmu.edu jseiber1@binghamton.edu beckmann@cs.cmu.edu ABSTRACT…
saved by
related reading
- abseil / Performance Hintsabseil.io
- A very concrete explanation of how a cache worksparksb.github.io
- Algorithms for Modern Hardware - Algorithmicaen.algorithmica.org
- What Every Programmer Should Know About Memoryakkadia.org
- What Every Programmer Should Know About Memorypeople.freebsd.org
- TPU Deep Divehenryhmko.github.io
- Cache Lines - Algorithmicaen.algorithmica.org
- abseil / Performance Hintsabseil.io
- Is software prefetching (__builtin_prefetch) useful for performance? – Daniel Lemire's bloglemire.me
- The compiler will optimize that away | RoyalSlothblog.royalsloth.eu
- CMSY9people.csail.mit.edu
- Reading privileged memory with a side-channel - Project Zerogoogleprojectzero.blogspot.com