paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Mind mappings: enabling efficient algorithm-accelerator mapping space search

Mind mappings:实现高效的算法-加速器映射空间搜索
ASPLOS Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems2021匹配度 1/10 · 该论文研究算法到加速器的映射空间搜索,属于体系结构与编译器/硬件协同优化方向,与用户关注的静态分析、LLM/Agent 程序分析、浮点程序分析及贝叶斯程序分析没有直接交集。其搜索优化问题虽涉及非凸非平滑空间,但未涉及 PL 或 LLM 交叉。引用 97 inbox
Kartik Hegde, Po-An Tsai, Sitao Huang, Vikas Chandra, Angshuman Parashar, Christopher W. Fletcher
crossref: 2026-09-12

AI 速览

一句话:提出 Mind mappings 以高效搜索算法到加速器的最优映射,避免低效映射带来的乘性效率开销。

现代计算依赖专用化来满足性能与效率需求,而设计专用硬件架构的核心挑战是算法到硬件的映射空间搜索。已有工作表明,低效映射会带来乘性效率开销;同时该搜索空间不仅庞大,而且非凸、非光滑,使先进搜索技术难以适用。因此,先前工作只能依赖专家选择或次优启发式。本文提出 Mind mappings,旨在实现高效的算法-加速器映射空间搜索。摘要未具体说明其技术路线与实验评估,但核心动机是克服上述搜索障碍,避免低效映射造成的效率损失。

问题
在高性能、高能效专用硬件设计中,如何执行算法到硬件的映射空间搜索,以找到最优映射。
方法
提出 Mind mappings,面向庞大、非凸且非光滑的映射空间实现高效搜索;摘要未披露其具体技术路线。
评估
摘要未报告实验评估方式与量化结果。
原文摘要(Abstract)

Modern day computing increasingly relies on specialization to satiate growing performance and efficiency requirements. A core challenge in designing such specialized hardware architectures is how to perform mapping space search, i.e., search for an optimal mapping from algorithm to hardware. Prior work shows that choosing an inefficient mapping can lead to multiplicative-factor efficiency overheads. Additionally, the search space is not only large but also non-convex and non-smooth, precluding advanced search techniques. As a result, previous works are forced to implement mapping space search using expert choices or sub-optimal search heuristics.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@inproceedings{paperbot6104,
  title = {Mind mappings: enabling efficient algorithm-accelerator mapping space search},
  author = {Kartik Hegde and Po-An Tsai and Sitao Huang and Vikas Chandra and Angshuman Parashar and Christopher W. Fletcher},
  booktitle = {ASPLOS},
  year = {2021},
  doi = {10.1145/3445814.3446762}
}