Analytical characterization and design space exploration for optimization of CNNs
Rui Li, Yufan Xu, Aravind Sukumaran-Rajam, Atanas Rountev, P. Sadayappan
摘要
Moving data through the memory hierarchy is a fundamental bottleneck that can limit the performance of core algorithms of machine learning, such as convolutional neural networks (CNNs). Loop-level optimization, including loop tiling and loop permutation, are fundamental transformations to reduce data movement. However, the search space for finding the best loop-level optimization configuration is explosively large. This paper develops an analytical modeling approach for finding the best loop-level optimization configuration for CNNs on multi-core CPUs. Experimental evaluation shows that this approach achieves comparable or better performance than state-of-the-art libraries and auto-tuning based optimizers for CNNs.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper14
- ROLLER: Fast and Efficient Tensor Compilation for Deep LearningHongyu Zhu, Ruofan Wu, Yijia Diao, Shanbin Ke 等OSDI 2022 · 被引用 84 次
- LLMCompass: Enabling Efficient Hardware Design for Large Language Model InferenceHengrui Zhang, August Ning, Rohan Baskar Prabhakar, David WentzlaffISCA 2024 · 被引用 58 次
- A full-stack search technique for domain optimized deep learning acceleratorsDan Zhang, Safeen Huda, Ebrahim M. Songhori, Kartik Prabhu 等ASPLOS 2022 · 被引用 48 次
- Chimera: An Analytical Optimizing Framework for Effective Compute-intensive Operators FusionSize Zheng, Siyuan Chen, Peidi Song, Renze Chen 等HPCA 2023 · 被引用 46 次
- DOSA: Differentiable Model-Based One-Loop Search for DNN AcceleratorsCharles Hong, Qijing Huang, Grace Dinh, Mahesh Subedar 等MICRO 2023 · 被引用 19 次
相关 Paper
- Optimizing the Memory Hierarchy by Compositing Automatic Transformations on Computations and DataJie Zhao, Peng DiMICRO 2020 · 被引用 32 次
- I/O lower bounds for auto-tuning of convolutions in CNNsXiaoyang Zhang, Junmin Xiao, Guangming TanPPoPP 2021 · 被引用 11 次
- IOOpt: automatic derivation of I/O complexity bounds for affine programsAuguste Olivry, Guillaume Iooss, Nicolas Tollenaere, Atanas Rountev 等PLDI 2021 · 被引用 10 次
- ALT: Breaking the Wall between Data Layout and Loop Optimizations for Deep Learning CompilationZhiying Xu, Jiafan Xu, Hongding Peng, Wei Wang 等EuroSys 2023 · 被引用 12 次
- Welder: Scheduling Deep Learning Memory Access via Tile-graphYining Shi, Zhi Yang, Jilong Xue, Lingxiao Ma 等OSDI 2023 · 被引用 64 次
