{"title":"Minimizing expected energy consumption for streaming applications with linear dependencies on chip multiprocessors","authors":"Ahmed Abousamra, R. Melhem, D. Mossé","doi":"10.1109/SIES.2009.5196201","DOIUrl":null,"url":null,"abstract":"Dynamic voltage scaling (DVS) is a widely applied power management mechanism in real-time systems. We propose an algorithm for scheduling periodic hard real-time streaming applications with linear dependencies and known probability distributions of computational requirements on chip multiprocessors (CMP). The goal of the scheduling is to minimize the expected energy consumption while satisfying two quality of service (QoS) requirements: throughput and response time. Our experiments show significant energy savings (up to 55%) over scheduling when only the worst case computational requirements are known. In addition, while dynamically reclaiming processor idle time across multiple processors yields small benefit when scheduling is based on the probability distribution of computational requirements, it results in significant energy savings when scheduling for the worst case, especially for applications with short deadlines.","PeriodicalId":133325,"journal":{"name":"2009 IEEE International Symposium on Industrial Embedded Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Symposium on Industrial Embedded Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIES.2009.5196201","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Dynamic voltage scaling (DVS) is a widely applied power management mechanism in real-time systems. We propose an algorithm for scheduling periodic hard real-time streaming applications with linear dependencies and known probability distributions of computational requirements on chip multiprocessors (CMP). The goal of the scheduling is to minimize the expected energy consumption while satisfying two quality of service (QoS) requirements: throughput and response time. Our experiments show significant energy savings (up to 55%) over scheduling when only the worst case computational requirements are known. In addition, while dynamically reclaiming processor idle time across multiple processors yields small benefit when scheduling is based on the probability distribution of computational requirements, it results in significant energy savings when scheduling for the worst case, especially for applications with short deadlines.