Worst-Case Execution Time Optimization of Story Patterns for Hard Real-Time Systems
Worst-Case Execution Time Optimization of Story Patterns for Hard Real-Time Systems
复制标题
硬实时系统故事模式的最坏情况执行时间优化
DOI：
--
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
M. Tichy
中科院分区：
文献类型：
--
作者：
Sven Burmester;H. Giese;Andreas Seibel;M. Tichy
在未来，技术系统预计将比今天更智能地运行，通过考虑传感器和网络通信探索的本地环境。为了实现这一愿景，系统必须能够表示和查询大量先验未知的可能情况并与之交互。因此，需要灵活的手段来存储、查询和操纵这样的上下文信息。已知的灵活和强大的表示是类图或其他类似图形的符号。然而，这种动态数据结构是不可预测的运行时定时行为的来源，传统上不推荐用于硬实时系统的开发。在本文中，我们描述了我们的努力，采用故事模式，这是用于规范的查询和更新操作的动态数据结构，在硬实时系统。
In the future, technical systems are expected to operate more intelligent than today by taking their local context explored by means of sensors and network communication into account. To realize this vision, the systems must be able to represent and query as well as interact with a large number of possible situations not known a priori. Therefore, flexible means to store, query, and manipulate such context information are required. Known flexible and powerful representations are class diagrams or other graph-like notations. However, such dynamic data structures which are sources for unpredictable run-time timing behavior are traditionally not recommended for the development of hard real-time systems. In this paper, we describe our efforts to employ story patterns, which are used for the specification of query and update operations on dynamic data structures, in hard real-time systems.