{"title":"动态嵌入式实时系统的边界能耗研究","authors":"H. Wu, B. Ravindran, E. Jensen","doi":"10.1145/1141277.1141494","DOIUrl":null,"url":null,"abstract":"We present a CPU scheduling algorithm, called the Energy-Bounded Utility Accrual Algorithm (or EBUA). EBUA is a polynomial-time algorithm that satisfies bounds on system-level energy consumption and activities' accrued timeliness utility. We analytically establish several timeliness properties of EBUA. Our simulation experiments using AMD's (DVS-enabled) k6 processor model confirm the algorithm's effectiveness and superiority.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On bounding energy consumption in dynamic, embedded real-time systems\",\"authors\":\"H. Wu, B. Ravindran, E. Jensen\",\"doi\":\"10.1145/1141277.1141494\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a CPU scheduling algorithm, called the Energy-Bounded Utility Accrual Algorithm (or EBUA). EBUA is a polynomial-time algorithm that satisfies bounds on system-level energy consumption and activities' accrued timeliness utility. We analytically establish several timeliness properties of EBUA. Our simulation experiments using AMD's (DVS-enabled) k6 processor model confirm the algorithm's effectiveness and superiority.\",\"PeriodicalId\":269830,\"journal\":{\"name\":\"Proceedings of the 2006 ACM symposium on Applied computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2006 ACM symposium on Applied computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1141277.1141494\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2006 ACM symposium on Applied computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1141277.1141494","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On bounding energy consumption in dynamic, embedded real-time systems
We present a CPU scheduling algorithm, called the Energy-Bounded Utility Accrual Algorithm (or EBUA). EBUA is a polynomial-time algorithm that satisfies bounds on system-level energy consumption and activities' accrued timeliness utility. We analytically establish several timeliness properties of EBUA. Our simulation experiments using AMD's (DVS-enabled) k6 processor model confirm the algorithm's effectiveness and superiority.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
