芯片上支持QoS的网络动态时隙分配

T. Marescaux, B. Bricke, P. Debacker, V. Nollet, H. Corporaal
{"title":"芯片上支持QoS的网络动态时隙分配","authors":"T. Marescaux, B. Bricke, P. Debacker, V. Nollet, H. Corporaal","doi":"10.1109/ESTMED.2005.1518069","DOIUrl":null,"url":null,"abstract":"MP-SoCs are expected to require complex communication architectures such as NoCs. This paper presents, to our knowledge, the first algorithm to dynamically perform routing and allocation of guaranteed communication resources on NoCs that provide QoS with TDMA techniques. We test the efficiency of our algorithm by allocating the communication channels required for an application composed of a 3D pipeline and an MPEG-2 decoder/encoder video chain on a 16 node MP-SoC. Dynamism in the communication is created by the 3D application. On a StrongARM processor clocked at 200 MHz, the allocation time for one time-slot takes about 1000 cycles per hop in the connection. We show that central time-slot allocation algorithms are practical for small-scale MP-SoC systems. Indeed, our algorithm can compute the allocation of 40 connections for a complex scene of the 3D pipeline in 450 to 900 /spl mu/s, depending on the slot table size.","PeriodicalId":119898,"journal":{"name":"3rd Workshop on Embedded Systems for Real-Time Multimedia, 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"39","resultStr":"{\"title\":\"Dynamic time-slot allocation for QoS enabled networks on chip\",\"authors\":\"T. Marescaux, B. Bricke, P. Debacker, V. Nollet, H. Corporaal\",\"doi\":\"10.1109/ESTMED.2005.1518069\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"MP-SoCs are expected to require complex communication architectures such as NoCs. This paper presents, to our knowledge, the first algorithm to dynamically perform routing and allocation of guaranteed communication resources on NoCs that provide QoS with TDMA techniques. We test the efficiency of our algorithm by allocating the communication channels required for an application composed of a 3D pipeline and an MPEG-2 decoder/encoder video chain on a 16 node MP-SoC. Dynamism in the communication is created by the 3D application. On a StrongARM processor clocked at 200 MHz, the allocation time for one time-slot takes about 1000 cycles per hop in the connection. We show that central time-slot allocation algorithms are practical for small-scale MP-SoC systems. Indeed, our algorithm can compute the allocation of 40 connections for a complex scene of the 3D pipeline in 450 to 900 /spl mu/s, depending on the slot table size.\",\"PeriodicalId\":119898,\"journal\":{\"name\":\"3rd Workshop on Embedded Systems for Real-Time Multimedia, 2005.\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"39\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"3rd Workshop on Embedded Systems for Real-Time Multimedia, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ESTMED.2005.1518069\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"3rd Workshop on Embedded Systems for Real-Time Multimedia, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ESTMED.2005.1518069","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 39

摘要

mp - soc预计需要复杂的通信架构,如noc。据我们所知,本文提出了第一个用TDMA技术在提供QoS的noc上动态执行路由和分配保证通信资源的算法。我们通过在16节点MP-SoC上分配由3D管道和MPEG-2解码器/编码器视频链组成的应用程序所需的通信通道来测试我们算法的效率。通信中的动态是由3D应用程序创建的。在频率为200mhz的StrongARM处理器上,一个时隙的分配时间在连接中每跳大约需要1000个周期。我们证明了中心时隙分配算法对于小规模MP-SoC系统是实用的。实际上,根据槽表的大小,我们的算法可以在450到900 /spl mu/s的速度下为3D管道的复杂场景计算40个连接的分配。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Dynamic time-slot allocation for QoS enabled networks on chip
MP-SoCs are expected to require complex communication architectures such as NoCs. This paper presents, to our knowledge, the first algorithm to dynamically perform routing and allocation of guaranteed communication resources on NoCs that provide QoS with TDMA techniques. We test the efficiency of our algorithm by allocating the communication channels required for an application composed of a 3D pipeline and an MPEG-2 decoder/encoder video chain on a 16 node MP-SoC. Dynamism in the communication is created by the 3D application. On a StrongARM processor clocked at 200 MHz, the allocation time for one time-slot takes about 1000 cycles per hop in the connection. We show that central time-slot allocation algorithms are practical for small-scale MP-SoC systems. Indeed, our algorithm can compute the allocation of 40 connections for a complex scene of the 3D pipeline in 450 to 900 /spl mu/s, depending on the slot table size.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
JPEG encoding on the Intel MXP5800: a platform-based design case study Workload characterization and cost-quality tradeoffs in MPEG-4 decoding on resource-constrained devices Operation shuffling for low energy L0 cluster generation on heterogeneous VLIW processors A component-based approach for MPSoC SW design: experience with OS customization for H.264 decoder An integrated CAD tool for ASIC implementation of multiplierless FIR filters with common sub-expression elimination optimization
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1