首页> 外文期刊>IEEE transactions on automation science and engineering >On Parametrizing Feasible Reconfigurable Systems Under Real-Time, Energy, and Resource Sharing Constraints
【24h】

On Parametrizing Feasible Reconfigurable Systems Under Real-Time, Energy, and Resource Sharing Constraints

机译:在实时,能量和资源共享约束下参加可行性可重新配置系统

获取原文
获取原文并翻译 | 示例

摘要

This article deals with reconfigurable uniprocessor systems powered by a renewable energy source under real-time and resource sharing constraints. A reconfigurable system is defined as a set of implementations, each of which is encoded by real-time periodic software tasks. Reconfiguration is a flexible runtime scenario that adapts the current system's implementation to any related environment evolution under well-defined conditions. A task is characterized by an effective calculated deadline that should be less than a maximum deadline defined in user requirements. The main problem is how to calculate the effective deadlines of the different periodic tasks in the different implementations under possibly the predicted renewable energy source and the sharing of resource constraints. We propose an offline method based on three solutions to calculate the deadlines of tasks. The first serves to compute the deadlines ensuring the real-time system feasibility and also minimizes the number of context switches by assigning the highest priority to the task with the smallest maximum deadline. The second computes the deadlines ensuring the respect of energy constraints, and the third computes the deadlines ensuring the respect of resource sharing constraints. These three solutions calculate the possible deadlines of each task in the hyperperiod of the corresponding implementations. We develop a new simulator called DEAD-CALC, that integrates a new tool called RANDOM-TASK for applying and evaluating the proposed solutions. The conducted experimentation proves that this methodology provides deadlines with affecting neither the load nor the processor speed while reducing the calculation time. Note to Practitioners-Real-time software is particularly difficult to design since, in addition to ever more complex functional constraints, it has to satisfy a set of stringent nonfunctional requirements, such as deadlines. In fact, the violation of deadlines can lead to breakdowns, data loss, and so on, which can be catastrophic for critical applications. This article presents the DEAD-CALC project for computing efficiently the deadlines of reconfigurable real-time devices to run possibly under energy and resource sharing constraints in all the system implementations. A device, in the software level, is a superset of implementations, each of which (i.e., a set of periodic software tasks) is activated and executed at a particular time according to user requirements. DEAD-CALC reduces the development time by computing the deadlines to be certainly respected without any additional feasibility analysis of the device. The calculation can only consider the real-time aspects, or both the harvesting energy and resource sharing constraints, giving the user the ability to configure the system under different conditions. DEAD-CALC is a visual environment that can be simply used by designers to compute and display these deadlines, with a few clicks, in arranged tables, and in a short time. This project can be a future reference for industrial partners who will be focusing on various real-time applications design, such as the intelligent manufacturing industry, intelligent transportation systems, embedded systems, wireless sensor networks, smart grids, medical control devices, and military platforms.
机译:本文涉及由实时和资源共享约束的可再生能源支持的可重新配置的Uniprocessor系统。可重新配置的系统被定义为一组实现,每个实施方式由实时定期软件任务编码。重新配置是一个灵活的运行时场景,可在明确定义的条件下使当前系统的实施方式适应任何相关环境演变。任务的特点是有效计算的截止日期,应小于用户要求中定义的最大截止日期。主要问题是如何计算不同实现中不同的定期任务的有效截止日期,可能是预测的可再生能源和资源约束的共享。我们提出了一种基于三个解决方案的离线方法来计算任务截止日期。第一个用于计算截止日期,确保实时系统可行性,并通过将最高优先级分配最大截止日期最小的任务来最小化上下文切换的数量。第二个计算确保能量约束的偏差的截止日期,并且第三计算截止日期,确保资源共享约束的尊重。这三种解决方案计算了相应实现的Hyperperiod中每个任务的可能截止日期。我们开发一个名为Dead-Calc的新模拟器,它集成了一个名为随机任务的新工具,以应用和评估所提出的解决方案。进行的实验证明,该方法提供了在减少计算时间的同时影响负载和处理器速度的截止日期。注意对于从业者来实时软件尤其困难地设计,因为除了更复杂的功能约束之外,它必须满足一组严格的非功能要求,例如截止日期。事实上,违反截止日期可能会导致故障,数据丢失等,这可能是关键应用的灾难性。本文介绍了用于计算可重新配置的实时设备的截止日期,以便在所有系统实现中的能量和资源共享约束下运行的可重新配置实时设备的截止日期。在软件级别的设备是一种实现的超集,每个实现(即,一组周期性软件任务)在根据用户要求的特定时间被激活和执行。死亡计算通过计算截止日期来减少开发时间,无需对设备的任何额外可行性分析。计算只能考虑实时方面,或者收获能量和资源共享约束,使用户能够在不同条件下配置系统。 DEAD-CALC是一个可视环境,可通过设计人员简单地使用,以计算和显示这些截止日期,并在排列的表中,在很短的时间内。该项目可以是将要关注各种实时应用设计的工业合作伙伴的未来参考,例如智能制造业,智能运输系统,嵌入式系统,无线传感器网络,智能电网,医疗控制设备和军用平台。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号