当前位置:首页 > 报告详情

DC25_PAPER_Track14_AcceleratingChipletPlacementAndRouting_HaeyeonKim_V2.pdf

上传人: S** 编号:1240787 2026-05-16 23页 2.25MB

1、 Information Classification:General Accelerating Chiplet Placement and Routing Optimization with Machine Learning Haeyeon Rachel Kim,KAIST haeyeonkimkaist.ac.kr Federico Berto,KAIST fbertokaist.ac.kr Junghyun Lee,KAIST Hyunjun An,KAIST Taein Shin,KAIST Chuanbo Hua,KAIST Jinkyoo Park,KAIST Youngwoo K

2、im,Sejong University Joungho Kim,KAIST Information Classification:General Abstract Chiplet technology has emerged as a promising solution to address the growing demand for improved system performance and customization while maintaining production cost efficiency.Chiplet-based systems offer several k

3、ey economic advantages over monolithic chips,including im proved wafer yield,mixed process technology node integration,reduced time to market,and the ability to overcome reticle size limitations.However,the heterogeneous integration of an increas ing number of chiplets and their interconnections pos

4、es a significant challenge in chiplet placement and routing.Chiplet placement is subject to various hard constraints,such as physical limitations,signal integrity,power integrity,and thermal coupling considerations,making it a complex problem distinct from traditional chip placement.In this paper,we

5、 formulate the chiplet placement and routing problem as a constrained combinatorial optimization task and propose a novel representation and benchmark for this problem.To overcome the challenges associated with reinforcement learning,such as extensive exploration and high computational costs,we empl

6、oy imitation learning,which offers faster and more stable training.We train autoregressive policies using expert data generated by our novel Place-to-Route heuristic algorithm,which effectively combines rule-based strategies with iterative optimization to produce high-quality solutions while ensurin

word格式文档无特别注明外均可编辑修改,预览文件经过压缩,下载原文更清晰!
三个皮匠报告文库所有资源均是客户上传分享,仅供网友学习交流,未经上传用户书面授权,请勿作商用。
1. **问题定义**:芯片放置与布线是NP-hard问题,需满足物理约束(无重叠)、信号完整性(SI)、电源完整性(PI)和热耦合等硬约束,目标是最小化数据速率加权布线长度。 2. **方法创新**:提出分层马尔可夫决策过程(MDP)框架,结合模仿学习(IL)与注意力模型,通过自回归策略学习放置与布线的联合优化。 3. **专家数据生成**:设计Place-to-Route启发式算法,结合规则策略与迭代优化,生成高质量训练数据(平均奖励-3.4)。 4. **性能验证**:IL策略在零样本测试中显著优于随机策略(奖励-45.73 vs. -10.73)和强化学习(-25.73 vs. -10.73),实现高效可重用设计。 5. **贡献**:定义新问题基准,开源工具(RL4CO),推动高性能、低成本芯片系统设计。
芯片块如何优化? 机器学习如何助力芯片设计? 芯片块布局有何挑战?
客服
商务合作
小程序
服务号
折叠