Synthesis Oriented Scheduling of Multiparty Rendezvous in Transaction Level Models

Vyas Venkataraman, Di Wang, A. Mahram, W. Qin, Mrinal Bose, J. Bhadra
{"title":"Synthesis Oriented Scheduling of Multiparty Rendezvous in Transaction Level Models","authors":"Vyas Venkataraman, Di Wang, A. Mahram, W. Qin, Mrinal Bose, J. Bhadra","doi":"10.1109/ISVLSI.2009.8","DOIUrl":null,"url":null,"abstract":"Due to the large semantic gap between transaction level models and actual implementations, hardware synthesis based on system level models has been a great challenge. Aiming to close the semantic gap, we studied an approach that uses rendezvous to model communication. By allowing both conjunctive and disjunctive composition of rendezvous, the approach supports flexible communication patterns involving multiple processes. However, a practical issue of the model is the complexity of scheduling of multiparty rendezvous, which is NP hard in general. This paper proposes an efficient scheduling algorithm. It begins by encapsulating state transition information of processes into a relation graph. It then creates a tree that relates edge combinations. The tree is used to guide the scheduler at run time to search for schedulable sets. Experimental results prove that this algorithm improves our scheduler significantly. The algorithm lays the ground for the synthesis of the communication and synchronization circuitry for the system.","PeriodicalId":137508,"journal":{"name":"2009 IEEE Computer Society Annual Symposium on VLSI","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Computer Society Annual Symposium on VLSI","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVLSI.2009.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Due to the large semantic gap between transaction level models and actual implementations, hardware synthesis based on system level models has been a great challenge. Aiming to close the semantic gap, we studied an approach that uses rendezvous to model communication. By allowing both conjunctive and disjunctive composition of rendezvous, the approach supports flexible communication patterns involving multiple processes. However, a practical issue of the model is the complexity of scheduling of multiparty rendezvous, which is NP hard in general. This paper proposes an efficient scheduling algorithm. It begins by encapsulating state transition information of processes into a relation graph. It then creates a tree that relates edge combinations. The tree is used to guide the scheduler at run time to search for schedulable sets. Experimental results prove that this algorithm improves our scheduler significantly. The algorithm lays the ground for the synthesis of the communication and synchronization circuitry for the system.
事务级模型中面向综合的多方交会调度
由于事务级模型与实际实现之间存在很大的语义差距,基于系统级模型的硬件综合一直是一个巨大的挑战。为了缩小语义差距,我们研究了一种使用集合来建模通信的方法。通过允许交会的合取和析取组合,该方法支持涉及多个进程的灵活通信模式。然而,该模型的一个实际问题是多方集合调度的复杂性,通常是NP困难的。本文提出了一种高效的调度算法。它首先将流程的状态转换信息封装到关系图中。然后,它创建一个关联边组合的树。该树用于指导调度程序在运行时搜索可调度集。实验结果表明,该算法显著改善了我们的调度程序。该算法为系统通信和同步电路的综合奠定了基础。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信