Resource Interfaces

Resource Interfaces
复制标题

DOI:
10.1007/978-3-540-45212-6_9
复制
发表时间:
2003
期刊:
--
影响因子:
--
通讯作者:
A. Chakrabarti;L. D. Alfaro;T. Henzinger;Marielle Stoelinga
A. Chakrabarti;L. D. Alfaro;T. Henzinger;Marielle Stoelinga
中科院分区:
其他
文献类型:
--
作者:
A. Chakrabarti;L. D. Alfaro;T. Henzinger;Marielle Stoelinga

文献摘要

被引文献

相似文献

我们提出了一种用于指定在有限资源上公开组件需求的组件接口的形式化方法。形式主义允许对两个或更多组件组合在一起时是否超出可用资源进行算法检查。此外,该形式可用于计算满足一组组件的需求所需的资源量。形式主义可以通过几种方式实例化。例如,几个组件可能从相同的电源获取电能。然后,形式主义支持兼容性检查,例如:当两个组件组合在一起时,是否可以在不超过可用峰值功率的情况下完成任务?或者,他们能否通过使用不超过最初可用的能量(即,随着时间积累的能量)来完成任务?我们的算法回答的相应定量问题如下:将两个组件放在一起所需的峰值功率是多少?相应的初始能量是多少?为了解决这些问题,我们将具有资源需求的界面建模为具有量化目标的博弈。在状态空间上玩游戏,其中每个状态由数字(表示例如功率消耗)来标记,并且游戏产生无限的标签路径。例如,目标可以是最小化在游戏期间出现的最大标签。我们通过对机器人控制软件组件和无线传感器网络组件的兼容性问题建模来说明我们的方法。
We present a formalism for specifying component interfaces that expose component requirements on limited resources. The formalism permits an algorithmic check if two or more components, when put together, exceed the available resources. Moreover, the formalism can be used to compute the quantity of resources necessary for satisfying the requirements of a collection of components. The formalism can be instantiated in several ways. For example, several components may draw power from the same source. Then, the formalism supports compatibility checks such as: can two components, when put together, achieve their tasks without ever exceeding the available amount of peak power? or, can they achieve their tasks by using no more than the initially available amount of energy (i.e., power accumulated over time)? The corresponding quantitative questions that our algorithms answer are the following: what is the amount of peak power needed for two components to be put together? what is the corresponding amount of initial energy? To solve these questions, we model interfaces with resource requirements as games with quantitative objectives. The games are played on state spaces where each state is labeled by a number (representing, e.g., power consumption), and a play produces an infinite path of labels. The objective may be, for example, to minimize the largest label that occurs during a play. We illustrate our approach by modeling compatibility questions for the components of robot control software, and of wireless sensor networks.