Extend Force-directed Scheduling for System-level Synthesis in Timeconstrained System-on-Chip Design

Qiang Wu, Renfa Li, Wei Wang, Wei Xie, Jinian Bian, Yunfeng Wang, Haili Wang
{"title":"Extend Force-directed Scheduling for System-level Synthesis in Timeconstrained System-on-Chip Design","authors":"Qiang Wu, Renfa Li, Wei Wang, Wei Xie, Jinian Bian, Yunfeng Wang, Haili Wang","doi":"10.1109/ICESS.2005.54","DOIUrl":null,"url":null,"abstract":"Scheduling time-constrained task graph to minimize resource requirement is a common and important problem in system-level synthesis (SLS) for system-onchip (SoC) designs. Many algorithms have been proposed to address this issue. In this paper, an extended scheduling algorithm based on force-directed heuristic is presented, which adopts a notion of continuous time rather than a notion of discrete time in high-level synthesis (HLS). Polynomial arithmetic is employed to calculate the force function and its extremal points. Preliminary experimental results show the feasibility of the proposed algorithm.","PeriodicalId":360757,"journal":{"name":"Second International Conference on Embedded Software and Systems (ICESS'05)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Second International Conference on Embedded Software and Systems (ICESS'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICESS.2005.54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Scheduling time-constrained task graph to minimize resource requirement is a common and important problem in system-level synthesis (SLS) for system-onchip (SoC) designs. Many algorithms have been proposed to address this issue. In this paper, an extended scheduling algorithm based on force-directed heuristic is presented, which adopts a notion of continuous time rather than a notion of discrete time in high-level synthesis (HLS). Polynomial arithmetic is employed to calculate the force function and its extremal points. Preliminary experimental results show the feasibility of the proposed algorithm.
面向时间约束的片上系统级综合的扩展力导向调度
调度时间约束任务图以最小化资源需求是系统级集成设计中常见而重要的问题。已经提出了许多算法来解决这个问题。本文提出了一种基于力导向启发式的扩展调度算法,该算法在高级综合中采用连续时间的概念而不是离散时间的概念。采用多项式算法计算力函数及其极值点。初步实验结果表明了该算法的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信