嵌入式多核系统的半在线可靠任务映射

IF 0.7 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS ACM Transactions on Modeling and Performance Evaluation of Computing Systems Pub Date : 2019-06-14 DOI:10.1145/3322899
Alireza Namazi, S. Safari, S. Mohammadi, Meisam Abdollahi
{"title":"嵌入式多核系统的半在线可靠任务映射","authors":"Alireza Namazi, S. Safari, S. Mohammadi, Meisam Abdollahi","doi":"10.1145/3322899","DOIUrl":null,"url":null,"abstract":"This article proposes a Semi Online Reliable Task (SORT) mapping approach to many-core platforms divided into two sections: offline and online. The offline section is a twofolded approach. It maintains the reliability of the mapped task graph against soft errors considering the reliability threshold defined by designers. As wear-out mechanisms decrease the lifetime of the system, our proposed approach increases the lifetime of the system using task migration scenarios. It specifies task migration plans with the minimum overhead using a novel heuristic approach. SORT maintains the required level of reliability of the task graph in the whole lifetime of the system using a replication technique with minimum replica overhead, maximum achievable performance, and minimum temperature increase. The online segment uses migration plans obtained in the offline segment to increase the lifetime and also permanently maintains the reliability threshold for the task graph during runtime. Results show that the effectiveness of SORT improves on bigger mesh sizes and higher reliability thresholds. Simulation results obtained from real benchmarks show that the proposed approach decreases design-time calculation up to 4,371% compared to exhaustive exploration while achieving a lifetime negligibly lower than the exhaustive solution (up to 5.83%).","PeriodicalId":56350,"journal":{"name":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems","volume":"31 1","pages":"11:1-11:25"},"PeriodicalIF":0.7000,"publicationDate":"2019-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"SORT: Semi Online Reliable Task Mapping for Embedded Multi-Core Systems\",\"authors\":\"Alireza Namazi, S. Safari, S. Mohammadi, Meisam Abdollahi\",\"doi\":\"10.1145/3322899\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article proposes a Semi Online Reliable Task (SORT) mapping approach to many-core platforms divided into two sections: offline and online. The offline section is a twofolded approach. It maintains the reliability of the mapped task graph against soft errors considering the reliability threshold defined by designers. As wear-out mechanisms decrease the lifetime of the system, our proposed approach increases the lifetime of the system using task migration scenarios. It specifies task migration plans with the minimum overhead using a novel heuristic approach. SORT maintains the required level of reliability of the task graph in the whole lifetime of the system using a replication technique with minimum replica overhead, maximum achievable performance, and minimum temperature increase. The online segment uses migration plans obtained in the offline segment to increase the lifetime and also permanently maintains the reliability threshold for the task graph during runtime. Results show that the effectiveness of SORT improves on bigger mesh sizes and higher reliability thresholds. Simulation results obtained from real benchmarks show that the proposed approach decreases design-time calculation up to 4,371% compared to exhaustive exploration while achieving a lifetime negligibly lower than the exhaustive solution (up to 5.83%).\",\"PeriodicalId\":56350,\"journal\":{\"name\":\"ACM Transactions on Modeling and Performance Evaluation of Computing Systems\",\"volume\":\"31 1\",\"pages\":\"11:1-11:25\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2019-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on Modeling and Performance Evaluation of Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3322899\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3322899","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 7

摘要

本文提出了一种半在线可靠任务(SORT)多核平台的映射方法,该多核平台分为离线和在线两部分。离线部分是一个双重的方法。它考虑设计者定义的可靠性阈值,保持映射任务图对软错误的可靠性。由于损耗机制减少了系统的生命周期,我们建议的方法使用任务迁移场景来增加系统的生命周期。它使用一种新颖的启发式方法,以最小的开销指定任务迁移计划。SORT使用复制技术在系统的整个生命周期中维护任务图所需的可靠性级别,该技术具有最小的复制开销、最大的可实现性能和最小的温度增加。在线网段使用离线网段获取的迁移计划来增加任务图的生存期,并在运行时永久维护任务图的可靠性阈值。结果表明,网格尺寸越大,可靠性阈值越高,SORT算法的有效性越好。从实际基准测试中获得的仿真结果表明,与穷极探索相比,所提出的方法减少了高达4,371%的设计时间计算,而实现的寿命比穷极解决方案(高达5.83%)低得可以忽略不计。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
SORT: Semi Online Reliable Task Mapping for Embedded Multi-Core Systems
This article proposes a Semi Online Reliable Task (SORT) mapping approach to many-core platforms divided into two sections: offline and online. The offline section is a twofolded approach. It maintains the reliability of the mapped task graph against soft errors considering the reliability threshold defined by designers. As wear-out mechanisms decrease the lifetime of the system, our proposed approach increases the lifetime of the system using task migration scenarios. It specifies task migration plans with the minimum overhead using a novel heuristic approach. SORT maintains the required level of reliability of the task graph in the whole lifetime of the system using a replication technique with minimum replica overhead, maximum achievable performance, and minimum temperature increase. The online segment uses migration plans obtained in the offline segment to increase the lifetime and also permanently maintains the reliability threshold for the task graph during runtime. Results show that the effectiveness of SORT improves on bigger mesh sizes and higher reliability thresholds. Simulation results obtained from real benchmarks show that the proposed approach decreases design-time calculation up to 4,371% compared to exhaustive exploration while achieving a lifetime negligibly lower than the exhaustive solution (up to 5.83%).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.10
自引率
0.00%
发文量
9
期刊最新文献
Configuring and Coordinating End-to-End QoS for Emerging Storage Infrastructure An approximation method for a non-preemptive multiserver queue with quasi-Poisson arrivals From compositional Petri Net modeling to macro and micro simulation by means of Stochastic Simulation and Agent-Based models No-regret Caching via Online Mirror Descent Optimal Pricing in a Single Server System
×
引用
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