{"title":"A Two-Pronged Approach of Power-Aware Voltage Scheduling for Real-Time Task Graphs in Multi-processor Systems","authors":"N. Kamiura, A. Saitoh, T. Isokawa, N. Matsui","doi":"10.1109/ISMVL.2009.29","DOIUrl":null,"url":null,"abstract":"A power-aware voltage-scheduling heuristic with offline and online components is presented for a hard real-time multi-processor system supporting multiple voltage levels. The offline component determines a voltage configuration for each task in a graph according to the worst-case scenario of task execution, to speed up paths with tasks. Once some path is speeded up, it next chooses and speeds up one of the paths sharing tasks with that path. The online component reclaims the slack, which occurs when some task actually finishes, to slow down the execution speed of its successor. Simulations are made to show the effectiveness of the proposed heuristic.","PeriodicalId":115178,"journal":{"name":"2009 39th International Symposium on Multiple-Valued Logic","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 39th International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2009.29","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
A power-aware voltage-scheduling heuristic with offline and online components is presented for a hard real-time multi-processor system supporting multiple voltage levels. The offline component determines a voltage configuration for each task in a graph according to the worst-case scenario of task execution, to speed up paths with tasks. Once some path is speeded up, it next chooses and speeds up one of the paths sharing tasks with that path. The online component reclaims the slack, which occurs when some task actually finishes, to slow down the execution speed of its successor. Simulations are made to show the effectiveness of the proposed heuristic.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
