Energy-aware task scheduling for streaming applications on NoC-based MPSoCs

IF 5.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Suhaimi Abd Ishak , Hui Wu , Umair Ullah Tariq
{"title":"Energy-aware task scheduling for streaming applications on NoC-based MPSoCs","authors":"Suhaimi Abd Ishak ,&nbsp;Hui Wu ,&nbsp;Umair Ullah Tariq","doi":"10.1016/j.jksuci.2024.102082","DOIUrl":null,"url":null,"abstract":"<div><p>Streaming applications are being extensively run on portable embedded systems, which are battery-operated and with limited memory. Thus, minimizing the total energy consumption of such a system is important. We investigate the problem of offline scheduling for streaming applications composed of non-preemptible periodic dependent tasks on homogeneous Network-on-Chip (NoC)-based Multiprocessor System-on-Chip (MPSoCs) such that their total energy consumption is minimized under memory constraints. We propose a novel unified approach that integrates task-level software pipelining with Dynamic Voltage and Frequency Scaling (DVFS) to solve the problem. Our approach is supported by a set of novel techniques, which include constructing an initial schedule based on a list scheduling where the priority of each task is its approximate successor-tree-consistent deadline such that the workload across all the processors is balanced, a retiming heuristic to transform intra-period dependencies into inter-period dependencies for enhancing parallelism, assigning an optimal discrete frequency for each task and each message using a Non-Linear Programming (NLP)-based algorithm and an Integer-Linear Programming (ILP)-based algorithm, and an incremental approach to reduce the memory usage of the retimed schedule in case of memory size violations. Using a set of real and synthetic benchmarks, we have implemented and compared our unified approach with two state-of-the-art approaches, RDAG+GeneS (<span>Wang et al., 2011</span>) , and JCCTS (<span>Wang et al., 2013a</span>). Experimental results show that our approach’s maximum, average, and minimum improvements over RDAG+GeneS (<span>Wang et al., 2011</span>) are 31.72%, 14.05%, and 7.00%, respectively. Our approach’s maximum, average, and minimum improvement over JCCTS (<span>Wang et al., 2013a</span>) are 35.58%, 17.04%, and 8.21%, respectively.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":null,"pages":null},"PeriodicalIF":5.2000,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S131915782400171X/pdfft?md5=9b5bfc05f1869e383654a6be6e74e93b&pid=1-s2.0-S131915782400171X-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of King Saud University-Computer and Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S131915782400171X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Streaming applications are being extensively run on portable embedded systems, which are battery-operated and with limited memory. Thus, minimizing the total energy consumption of such a system is important. We investigate the problem of offline scheduling for streaming applications composed of non-preemptible periodic dependent tasks on homogeneous Network-on-Chip (NoC)-based Multiprocessor System-on-Chip (MPSoCs) such that their total energy consumption is minimized under memory constraints. We propose a novel unified approach that integrates task-level software pipelining with Dynamic Voltage and Frequency Scaling (DVFS) to solve the problem. Our approach is supported by a set of novel techniques, which include constructing an initial schedule based on a list scheduling where the priority of each task is its approximate successor-tree-consistent deadline such that the workload across all the processors is balanced, a retiming heuristic to transform intra-period dependencies into inter-period dependencies for enhancing parallelism, assigning an optimal discrete frequency for each task and each message using a Non-Linear Programming (NLP)-based algorithm and an Integer-Linear Programming (ILP)-based algorithm, and an incremental approach to reduce the memory usage of the retimed schedule in case of memory size violations. Using a set of real and synthetic benchmarks, we have implemented and compared our unified approach with two state-of-the-art approaches, RDAG+GeneS (Wang et al., 2011) , and JCCTS (Wang et al., 2013a). Experimental results show that our approach’s maximum, average, and minimum improvements over RDAG+GeneS (Wang et al., 2011) are 31.72%, 14.05%, and 7.00%, respectively. Our approach’s maximum, average, and minimum improvement over JCCTS (Wang et al., 2013a) are 35.58%, 17.04%, and 8.21%, respectively.

基于 NoC 的 MPSoC 上流媒体应用的能量感知任务调度
流媒体应用正在便携式嵌入式系统上广泛运行,这些系统由电池驱动,内存有限。因此,最大限度地降低此类系统的总能耗非常重要。我们研究了基于同构片上网络(NoC)的多处理器片上系统(MPSoC)上由不可抢占的周期性依赖任务组成的流媒体应用的离线调度问题,从而在内存约束条件下最大限度地降低其总能耗。我们提出了一种新颖的统一方法,将任务级软件流水线与动态电压和频率扩展(DVFS)相结合来解决这一问题。我们的方法得到了一系列新技术的支持,其中包括基于列表调度构建初始调度,其中每个任务的优先级都是其近似后继树一致的截止日期,从而平衡所有处理器的工作量;重定时启发式将周期内的依赖关系转化为周期间的依赖关系,以增强并行性、使用基于非线性编程(NLP)的算法和基于整数线性编程(ILP)的算法,为每项任务和每条信息分配最佳离散频率,并采用增量方法,在内存大小违规的情况下减少重新定时计划的内存使用量。利用一组真实和合成基准,我们实现了我们的统一方法,并将其与 RDAG+GeneS (Wang 等人,2011 年)和 JCCTS (Wang 等人,2013a)这两种最先进的方法进行了比较。实验结果表明,与 RDAG+GeneS(Wang 等,2011 年)相比,我们的方法的最大、平均和最小改进率分别为 31.72%、14.05% 和 7.00%。与 JCCTS(Wang 等,2013a)相比,我们的方法的最大、平均和最小改进率分别为 35.58%、17.04% 和 8.21%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
10.50
自引率
8.70%
发文量
656
审稿时长
29 days
期刊介绍: In 2022 the Journal of King Saud University - Computer and Information Sciences will become an author paid open access journal. Authors who submit their manuscript after October 31st 2021 will be asked to pay an Article Processing Charge (APC) after acceptance of their paper to make their work immediately, permanently, and freely accessible to all. The Journal of King Saud University Computer and Information Sciences is a refereed, international journal that covers all aspects of both foundations of computer and its practical applications.
文献相关原料
公司名称 产品信息 采购帮参考价格
×
引用
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学术官方微信