Statistical timing-yield driven scheduling and FU binding in latch-based datapath synthesis

Keisuke Inoue, M. Kaneko
{"title":"Statistical timing-yield driven scheduling and FU binding in latch-based datapath synthesis","authors":"Keisuke Inoue, M. Kaneko","doi":"10.1109/MWSCAS.2012.6292099","DOIUrl":null,"url":null,"abstract":"In the presence of process variation, conventional worst-case timing analysis is no longer able to fully realize the benefit of scaling and integrating. As a result, statistical static timing analysis (SSTA) is essentially needed in high-level synthesis (HLS) stage. This paper presents the first work to develop a design framework of SSTA for HLS based on transparent latches. An integer linear programming-based formal approach is provided to simultaneously solve scheduling and functional unit binding to minimize the scheduling length while meeting the timing-yield requirement. Experiments demonstrate the effectiveness of the proposed approach.","PeriodicalId":324891,"journal":{"name":"2012 IEEE 55th International Midwest Symposium on Circuits and Systems (MWSCAS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 55th International Midwest Symposium on Circuits and Systems (MWSCAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS.2012.6292099","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the presence of process variation, conventional worst-case timing analysis is no longer able to fully realize the benefit of scaling and integrating. As a result, statistical static timing analysis (SSTA) is essentially needed in high-level synthesis (HLS) stage. This paper presents the first work to develop a design framework of SSTA for HLS based on transparent latches. An integer linear programming-based formal approach is provided to simultaneously solve scheduling and functional unit binding to minimize the scheduling length while meeting the timing-yield requirement. Experiments demonstrate the effectiveness of the proposed approach.
统计时序-产量驱动调度与基于闩锁的数据路径合成中的FU绑定
在存在工艺变化的情况下,传统的最坏时序分析已不能充分实现规模化和集成化的优势。因此,统计静态时序分析(SSTA)在高阶综合(HLS)阶段必不可少。本文首次提出了基于透明锁存器的HLS SSTA设计框架。提出了一种基于整数线性规划的形式化方法来同时解决调度和功能单元绑定问题,从而在满足时序成品率要求的同时最小化调度长度。实验证明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信