片上网络周期性分组通信TDMA调度的配置与优化

Tim Harde, Matthias Freier, G. V. D. Brüggen, Jian-Jia Chen
{"title":"片上网络周期性分组通信TDMA调度的配置与优化","authors":"Tim Harde, Matthias Freier, G. V. D. Brüggen, Jian-Jia Chen","doi":"10.1145/3273905.3273928","DOIUrl":null,"url":null,"abstract":"In recent years, embedded system design has changed due to an increased demand for computing power and a rising complexity of control tasks. In this paper, we present an approach to create a contention-free communication schedule for a Network on Chip (NoC) using a global Time Division Multiple Access (TDMA) schedule. TDMA can provide an isolation property among interfering tasks and a bandwidth guarantee for different communication paths. The approach allows the derivation of a predictable timing behavior for the communication. The communication schedule is designed using two scheduling strategies: a first-fit greedy strategy and a solver-based approach called rectangular allocation. In the experiments, the approaches are evaluated with synthetic communication task sets on a 2D-meshed NoC-topology.","PeriodicalId":236964,"journal":{"name":"Proceedings of the 26th International Conference on Real-Time Networks and Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Configurations and Optimizations of TDMA Schedules for Periodic Packet Communication on Networks on Chip\",\"authors\":\"Tim Harde, Matthias Freier, G. V. D. Brüggen, Jian-Jia Chen\",\"doi\":\"10.1145/3273905.3273928\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, embedded system design has changed due to an increased demand for computing power and a rising complexity of control tasks. In this paper, we present an approach to create a contention-free communication schedule for a Network on Chip (NoC) using a global Time Division Multiple Access (TDMA) schedule. TDMA can provide an isolation property among interfering tasks and a bandwidth guarantee for different communication paths. The approach allows the derivation of a predictable timing behavior for the communication. The communication schedule is designed using two scheduling strategies: a first-fit greedy strategy and a solver-based approach called rectangular allocation. In the experiments, the approaches are evaluated with synthetic communication task sets on a 2D-meshed NoC-topology.\",\"PeriodicalId\":236964,\"journal\":{\"name\":\"Proceedings of the 26th International Conference on Real-Time Networks and Systems\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 26th International Conference on Real-Time Networks and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3273905.3273928\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 26th International Conference on Real-Time Networks and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3273905.3273928","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

近年来,由于对计算能力的需求增加和控制任务的复杂性增加,嵌入式系统设计发生了变化。在本文中,我们提出了一种使用全局时分多址(TDMA)调度为片上网络(NoC)创建无争用通信调度的方法。TDMA可以提供干扰任务间的隔离特性和不同通信路径的带宽保证。该方法允许为通信派生可预测的定时行为。通信调度采用两种调度策略:一种是首次拟合贪婪策略,另一种是基于求解器的矩形分配策略。在实验中,利用二维网格noc拓扑上的综合通信任务集对这些方法进行了评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Configurations and Optimizations of TDMA Schedules for Periodic Packet Communication on Networks on Chip
In recent years, embedded system design has changed due to an increased demand for computing power and a rising complexity of control tasks. In this paper, we present an approach to create a contention-free communication schedule for a Network on Chip (NoC) using a global Time Division Multiple Access (TDMA) schedule. TDMA can provide an isolation property among interfering tasks and a bandwidth guarantee for different communication paths. The approach allows the derivation of a predictable timing behavior for the communication. The communication schedule is designed using two scheduling strategies: a first-fit greedy strategy and a solver-based approach called rectangular allocation. In the experiments, the approaches are evaluated with synthetic communication task sets on a 2D-meshed NoC-topology.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信