arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.02800cs.DCcs.PL
收藏

基于静态程序分析和基本块演化建模的能量边界推断

Inferring Energy Bounds via Static Program Analysis and Evolutionary Modeling of Basic Blocks

Umer Liqat, Zorana Bankovic, Pedro Lopez-Garcia, Manuel V. Hermenegildo

摘要:

不断增加的能量受限设备(例如物联网应用、智能手机和关键任务系统中使用的设备)的数量和复杂性对优化其能量消耗并验证其将在可用能量预算内执行其功能的技术提出了重要挑战。在这项工作中,我们从软件的角度来解决这一挑战,并提出了一种新的参数化方法来估计严格的边界上的能源消耗的程序执行,是实际的能源验证和优化的应用。我们的方法将程序划分为基本(无分支)块,并使用进化算法估计每个块的最大和最小能耗。然后根据程序控制流程,使用静态分析,将获得的值组合,以推断函数,该函数给出整个程序及其过程的能量消耗的上界和下界,作为关于输入数据大小的函数。我们已经测试了我们的方法(类C)嵌入式程序运行在XMOS硬件平台上。然而,我们的方法是通用的,足以适用于其他微处理器架构和程序设计语言。我们的原型实现所获得的界限可以很紧,同时在实践中保持在预算的安全侧,正如我们的实验评估所示。

英文摘要:

The ever increasing number and complexity of energy-bound devices (such as the ones used in Internet of Things applications, smart phones, and mission critical systems) pose an important challenge on techniques to optimize their energy consumption and to verify that they will perform their function within the available energy budget. In this work we address this challenge from the software point of view and propose a novel parametric approach to estimating tight bounds on the energy consumed by program executions that are practical for their application to energy verification and optimization. Our approach divides a program into basic (branchless) blocks and estimates the maximal and minimal energy consumption for each block using an evolutionary algorithm. Then it combines the obtained values according to the program control flow, using static analysis, to infer functions that give both upper and lower bounds on the energy consumption of the whole program and its procedures as functions on input data sizes. We have tested our approach on (C-like) embedded programs running on the XMOS hardware platform. However, our method is general enough to be applied to other microprocessor architectures and programming languages. The bounds obtained by our prototype implementation can be tight while remaining on the safe side of budgets in practice, as shown by our experimental evaluation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑