DTFM: a flexible model for schedulability analysis of real-time applications on NoC-based architectures

Mourad Dridi, S. Rubini, Frank Singhoff, J. Diguet
{"title":"DTFM: a flexible model for schedulability analysis of real-time applications on NoC-based architectures","authors":"Mourad Dridi, S. Rubini, Frank Singhoff, J. Diguet","doi":"10.1145/3177803.3177812","DOIUrl":null,"url":null,"abstract":"Many-core processors are expected to be hardware targets to support the execution of real-time applications. In a many-core processor, cores communicate through a Network-On-Chip (NoC), which offers high bandwidth and scalability, but also introduces contentions leading to additional variability to task execution times. Such contentions also strongly increase the pessimistic trend of worst case execution time estimation. Consequently, modeling and analysis of network contentions interferences on many-core processors is a challenge to support real-time applications. In this article, we formalize a dual task and flow model called DTFM. From the specification of a real-time application composed of a set of tasks and their communication dependencies, DTFM allows us to compute flow requirements and to assess predictability of the tasks. DTFM is extensible enough to be adapted to various NoCs and task models, allowing designers to compare candidate software and NoC architectures. Furthermore, we introduce an original validation approach based on the cross-use of a task level real-time scheduling analysis tool and a cycle-accurate SystemC NoC simulator.","PeriodicalId":447904,"journal":{"name":"SIGBED Rev.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGBED Rev.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3177803.3177812","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Many-core processors are expected to be hardware targets to support the execution of real-time applications. In a many-core processor, cores communicate through a Network-On-Chip (NoC), which offers high bandwidth and scalability, but also introduces contentions leading to additional variability to task execution times. Such contentions also strongly increase the pessimistic trend of worst case execution time estimation. Consequently, modeling and analysis of network contentions interferences on many-core processors is a challenge to support real-time applications. In this article, we formalize a dual task and flow model called DTFM. From the specification of a real-time application composed of a set of tasks and their communication dependencies, DTFM allows us to compute flow requirements and to assess predictability of the tasks. DTFM is extensible enough to be adapted to various NoCs and task models, allowing designers to compare candidate software and NoC architectures. Furthermore, we introduce an original validation approach based on the cross-use of a task level real-time scheduling analysis tool and a cycle-accurate SystemC NoC simulator.
DTFM:一个灵活的模型,用于分析基于noc架构的实时应用程序的可调度性
多核处理器有望成为支持实时应用程序执行的硬件目标。在多核处理器中,内核通过片上网络(Network-On-Chip, NoC)进行通信,这提供了高带宽和可伸缩性,但也引入了竞争,导致任务执行时间的额外可变性。这种争论也强烈地增加了最坏情况下执行时间估计的悲观趋势。因此,对多核处理器上的网络竞争干扰进行建模和分析是支持实时应用的一个挑战。在本文中,我们形式化了一个称为DTFM的双重任务和流模型。根据由一组任务及其通信依赖项组成的实时应用程序的规范,DTFM允许我们计算流需求并评估任务的可预测性。DTFM具有足够的可扩展性,可以适应各种NoC和任务模型,允许设计人员比较候选软件和NoC体系结构。此外,我们还介绍了一种基于任务级实时调度分析工具和周期精确的SystemC NoC模拟器交叉使用的原始验证方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信