毕业论文答辩-基于电池供电的DVS嵌入式系统的低功耗设计与实现.pptVIP

毕业论文答辩-基于电池供电的DVS嵌入式系统的低功耗设计与实现.ppt

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
电子0703 班 本科毕业设计答辩 The Design and Implementation of Low Power Consumption DVS Embedded System Based on Battery Supply Organization *Research Background *Motivation *Battery-aware voltage scheduling algorithm *DVS for minimizing cost function *The problem we face *How we solve the problem *Flow chart *The experiment we make Research Background *Research Background *Large amount of power consumption causes the greenhouse effects and hazards our environment. *Dynamic Voltage Scaling (DVS) technology of processors emerges. Motivation Battery-aware voltage scheduling algorithm DVS for minimizing cost function *DVS change the Ik and execution time of operation *Cost funtion: *Ik: Current of operation k * The problem we face *DVS :A NP - hard problem proven by predecessors. *Brutal force search algorithm to get the minimum value of cost function. *Large amount of energy consumption and computing time(because of 625 times of comparision each time). How we solve the problem *The Lagrange multiplier method can solve our problem. * (Constrain condition) * Flow chart The experiment result Aperiodic operation The experiment result Periodic operations The experiment result The algorithm running on the W90P710 Firstly we schedule allthe operations, then we check whether operation load failure. If yes, we judge whether these operations are schedulable for another time. If this time, we fail again. We will get failure, and these operations can not be schedulable. If not, we assign the available slack time. Then we swap the most effective operation, then check whether there is any operation can be swapped. If yes, assign the slack time again. If not, we succeed. * Firstly we schedule allthe operations, then we check whether operation load failure. If yes, we judge whether these operations are schedulable for another time. If this time, w

文档评论(0)

***** + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档