Simultaneous Optimisation of Task Mapping and Priority Assignment for Real-Time Embedded NoCs

M. Sayuti, L. Indrusiak
{"title":"Simultaneous Optimisation of Task Mapping and Priority Assignment for Real-Time Embedded NoCs","authors":"M. Sayuti, L. Indrusiak","doi":"10.1109/PDP.2015.84","DOIUrl":null,"url":null,"abstract":"In a hard real-time embedded system based on a fixed priority pre-emptive Networks-On-Chip (NoC), the provision of guaranteed services may require pre-emption of some tasks and messages based on their priorities. In a worst case scenario, the interference imposed to low priority tasks can cause substantial computation and communication delays that can exceed their deadlines, leading to an unschedulable system. In a task mapping optimisation process, changing task mappings does not always produce a schedulable task mapping. In this paper, we propose an approach that simultaneously optimises task mapping and priority assignment, aiming to find a configuration that can completely satisfy the timing constraints of the system. Differing to the state-of-the-art, our approach takes into account the overall schedulability of the system by considering the worst-case end-to-end response time of all mapped tasks. As a result, we are able to increase the quality of task mappings at the same time improving the convergence of the optimisation algorithm, better than the previous approaches that solely focus on the task mapping optimisation to make the system schedulable.","PeriodicalId":285111,"journal":{"name":"2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDP.2015.84","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

In a hard real-time embedded system based on a fixed priority pre-emptive Networks-On-Chip (NoC), the provision of guaranteed services may require pre-emption of some tasks and messages based on their priorities. In a worst case scenario, the interference imposed to low priority tasks can cause substantial computation and communication delays that can exceed their deadlines, leading to an unschedulable system. In a task mapping optimisation process, changing task mappings does not always produce a schedulable task mapping. In this paper, we propose an approach that simultaneously optimises task mapping and priority assignment, aiming to find a configuration that can completely satisfy the timing constraints of the system. Differing to the state-of-the-art, our approach takes into account the overall schedulability of the system by considering the worst-case end-to-end response time of all mapped tasks. As a result, we are able to increase the quality of task mappings at the same time improving the convergence of the optimisation algorithm, better than the previous approaches that solely focus on the task mapping optimisation to make the system schedulable.
实时嵌入式noc任务映射和优先级分配的同步优化
在基于固定优先级抢占式片上网络(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学术文献互助群
群 号:481959085
Book学术官方微信