发布求助
文献互助 智能选刊 最新文献

Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99最新文献

筛选
英文 中文
Protocol for wireless real-time systems 无线实时系统协议
Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99 Pub Date : 1999-06-09 DOI: 10.1109/EMRTS.1999.777463
H. Bengtsson, E. Uhlemann, P. Wiberg
{"title":"Protocol for wireless real-time systems","authors":"H. Bengtsson, E. Uhlemann, P. Wiberg","doi":"10.1109/EMRTS.1999.777463","DOIUrl":"https://doi.org/10.1109/EMRTS.1999.777463","url":null,"abstract":"A protocol and a communication mechanism intended for time and safety critical applications using a radio channel for information transport are considered jointly. The protocol is based on a scheme of retransmissions done on demand within a given time window. Each retransmission is coded with a varying number of redundant symbols. The set of blocks used for retransmission is controlled by two quality-of-service parameters: deadline for the transmission and the probability that the correct decoded message will reach the recipient before this deadline. Analysis of a protocol model indicates that it is possible to transmit time critical information in a mobile wireless system with very low error probabilities in an industrial environment.","PeriodicalId":124408,"journal":{"name":"Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126662771","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 20
Finding the minimum available transmission time for the timed token medium access control protocol 查找定时令牌介质访问控制协议的最小可用传输时间
Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99 Pub Date : 1999-06-09 DOI: 10.1109/EMRTS.1999.777465
Sijing Zhang, E. S. Lee, A. Burns, Hongji Yang
{"title":"Finding the minimum available transmission time for the timed token medium access control protocol","authors":"Sijing Zhang, E. S. Lee, A. Burns, Hongji Yang","doi":"10.1109/EMRTS.1999.777465","DOIUrl":"https://doi.org/10.1109/EMRTS.1999.777465","url":null,"abstract":"Exactly capturing the minimum available time for a network node to transmit its synchronous messages during any given length of time is important for guaranteeing the transmission of synchronous messages before their deadlines in a timed token ring network (such as FDDI) where the timed token medium access control protocol is used. Previous results which only give a lower bound on the minimum transmission time could be too pessimistic for supporting the timely delivery of synchronous traffic in a hard real-time communication environment. This paper presents an O(n)-time algorithm for exactly determining the minimum available transmission time. The algorithm can be used to test whether or not a given allocation of synchronous bandwidths can guarantee a synchronous message set with message deadlines no more than periods; the test so formed is better than any previous testing method whose test is sufficient only, in the sense that it is both sufficient and necessary and therefore optimal.","PeriodicalId":124408,"journal":{"name":"Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132069202","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
A comparison of fixed-priority and static cyclic scheduling for distributed automotive control applications 分布式汽车控制应用中固定优先级和静态循环调度的比较
Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99 Pub Date : 1999-06-09 DOI: 10.1109/EMRTS.1999.777460
Henrik Lönn, J. Axelsson
{"title":"A comparison of fixed-priority and static cyclic scheduling for distributed automotive control applications","authors":"Henrik Lönn, J. Axelsson","doi":"10.1109/EMRTS.1999.777460","DOIUrl":"https://doi.org/10.1109/EMRTS.1999.777460","url":null,"abstract":"This paper compares different scheduling policies applied to distributed systems intended for automotive real-time control applications. We describe the characteristics of systems using fixed priority (FP) and static cyclic (SC) scheduling of processors and bus communication, with combinations ranging from FP bus-FP processors to SC bus-SC processors. FP bus is represented by the Controller Area Network protocol (CAN) and SC bus by a Time Division Multiple Access (TDMA) protocol. We also study the effects of using a global time base. Our main concern is control performance, including input and output jitter and control delay and therefore the response time of a sequence of control tasks and the related communication. For each system configuration we analyze the expected response times of a series of control related tasks (delay) and the temporal variation of the input and output instants (jitter).","PeriodicalId":124408,"journal":{"name":"Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127746481","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 57
Cluster simulation-support for distributed development of hard real-time systems using TDMA-based communication 集群仿真——支持基于tdma通信的硬实时系统的分布式开发
Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99 Pub Date : 1999-06-09 DOI: 10.1109/EMRTS.1999.777461
Thomas M. Galla, R. Pallierer
{"title":"Cluster simulation-support for distributed development of hard real-time systems using TDMA-based communication","authors":"Thomas M. Galla, R. Pallierer","doi":"10.1109/EMRTS.1999.777461","DOIUrl":"https://doi.org/10.1109/EMRTS.1999.777461","url":null,"abstract":"In the field of safety-critical real-time systems the development of distributed applications for fault tolerance reasons is a common practice. Hereby the whole application is divided into several distinct sub-systems, which are afterwards mapped onto a set of associated processors cabled nodes. Cluster simulation provides a cheap and useful technique to test single nodes of a distributed application in isolation. Compared to alternative test approaches where the whole distributed system has to be built up the hardware requirements imposed by cluster simulation are rather small. We present an approach together with a prototype implementation for cluster simulation in distributed hard real-time systems using TDMA-based communication. This cluster simulator has proven to be a valuable development support tool for single nodes within a distributed application by providing a versatile platform for validation of the nodes behavior against the rest of the distributed system.","PeriodicalId":124408,"journal":{"name":"Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132156532","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Formally specified monitoring of temporal properties 正式指定的时间属性监控
Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99 Pub Date : 1999-06-09 DOI: 10.1109/EMRTS.1999.777457
Moonjoo Kim, Mahesh Viswanathan, H. Ben-Abdallah, Sampath Kannan, Insup Lee, O. Sokolsky
{"title":"Formally specified monitoring of temporal properties","authors":"Moonjoo Kim, Mahesh Viswanathan, H. Ben-Abdallah, Sampath Kannan, Insup Lee, O. Sokolsky","doi":"10.1109/EMRTS.1999.777457","DOIUrl":"https://doi.org/10.1109/EMRTS.1999.777457","url":null,"abstract":"We describe the Monitoring and Checking (MaC) framework which provides assurance on the correctness of an execution of a real-time system at runtime. Monitoring is performed based on a formal specification of system requirements. MaC bridges the gap between formal specification, which analyzes designs rather than implementations, and testing, which validates implementations but lacks formality. An important aspect of the framework is a clear separation between implementation-dependent description of monitored objects and high-level requirements specification. Another salient feature is automatic instrumentation of executable code. The paper presents an overview of the framework, languages to express monitoring scripts and requirements, and a prototype implementation of MaC targeted at systems implemented in Java.","PeriodicalId":124408,"journal":{"name":"Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133539024","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 148
Shadowing-based crash recovery schemes for real-time database systems 基于阴影的实时数据库系统崩溃恢复方案
Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99 Pub Date : 1999-06-09 DOI: 10.1109/EMRTS.1999.777473
Lihchyun Shu, Huey-Min Sun, Tei-Wei Kuo
{"title":"Shadowing-based crash recovery schemes for real-time database systems","authors":"Lihchyun Shu, Huey-Min Sun, Tei-Wei Kuo","doi":"10.1109/EMRTS.1999.777473","DOIUrl":"https://doi.org/10.1109/EMRTS.1999.777473","url":null,"abstract":"Predictable performance in the event of failures is of paramount importance in most safety critical real-time database systems. Our research addresses new crash recovery techniques that accommodate pre-run-time timing analysis and utilize design-time information about transactions' data access patterns to improve performance at run time and system restart time. The schemes we will propose are based on a form of shadowing. In contrast to the shadow version algorithm as described previously our schemes reduce overheads at run time, shorten the blocking duration necessary in the transactions' atomic commitment stage, eliminate dynamic storage allocation and reclamation, and permit very fast and bounded-time recovery after a crash by simply retrieving the master record and system version directory from nonvolatile storage. The data structures and algorithms used by our recovery schemes differ when different concurrency control protocols are used. We analyze their characteristics and their impacts on the performance of real-time database systems. Quantitative evaluation of our technique indicates the schemes are much more efficient than traditional log-based techniques.","PeriodicalId":124408,"journal":{"name":"Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124196123","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Experiments with parametric verification of real-time systems 实时系统的参数验证实验
Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99 Pub Date : 1999-06-09 DOI: 10.1109/EMRTS.1999.777458
R. L. Spelberg, Ruud C. M. de Rooij, H. Toetenel
{"title":"Experiments with parametric verification of real-time systems","authors":"R. L. Spelberg, Ruud C. M. de Rooij, H. Toetenel","doi":"10.1109/EMRTS.1999.777458","DOIUrl":"https://doi.org/10.1109/EMRTS.1999.777458","url":null,"abstract":"The paper addresses experiments with parametric verification of real-time systems based on model-checking of models of these systems. We apply a model checking a algorithm that implements the partition refinement approach. The models itself are based on the timed automata model of Alur and Dill (1994). The model specification language XTG enables the specification of constant parameters, which are given a valuation during the verification process. The outcome of the verification is presented as relations over the parameters within the specification. This feature adds a substantial power to the model-checking approach to verification. We demonstrate the usefulness of parametric verification by means of two small examples.","PeriodicalId":124408,"journal":{"name":"Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124479862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Worst-case execution times and schedulability analysis of statecharts models 状态图模型的最坏情况执行时间和可调度性分析
Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99 Pub Date : 1999-06-09 DOI: 10.1109/EMRTS.1999.777452
E. Erpenbach, P. Altenbernd
{"title":"Worst-case execution times and schedulability analysis of statecharts models","authors":"E. Erpenbach, P. Altenbernd","doi":"10.1109/EMRTS.1999.777452","DOIUrl":"https://doi.org/10.1109/EMRTS.1999.777452","url":null,"abstract":"Synchronous languages have proven to be very adequate for the modeling of embedded systems. However, such languages assume that all responses to external stimuli are computed infinitely fast (in zero time). It is the task of lower design steps to ensure that timeliness requirements are met even when the actual execution time of the generated code on the target is taken into account. Being able to determine both the worst-case execution time (WCET) an the worst-case response time (WCRT) of synchronous models is therefore crucial for the design of real-rime applications. This paper focuses on the language statecharts, but describes a method for analyzing the real-time behavior of synchronous models in general. For this purpose, we take aspects specific to the semantics of synchronous languages into consideration to provide both an efficient and accurate analysis of tasks generated from synchronous models. This method has been integrated in a code generator for STATEMATE and experimental results are presented.","PeriodicalId":124408,"journal":{"name":"Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122445499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 26
Adaptation and graceful degradation of control system performance by task reallocation and period adjustment 任务再分配和周期调整控制系统性能的自适应和优雅退化
Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99 Pub Date : 1999-06-09 DOI: 10.1109/EMRTS.1999.777447
K. Shin, Charles L. Meissner
{"title":"Adaptation and graceful degradation of control system performance by task reallocation and period adjustment","authors":"K. Shin, Charles L. Meissner","doi":"10.1109/EMRTS.1999.777447","DOIUrl":"https://doi.org/10.1109/EMRTS.1999.777447","url":null,"abstract":"In this paper, we consider resource adaptation in multiprocessor real-time control systems running periodic control tasks, where the main resource is processor utilization, and the measure of utility is control performance. Processor utilization of a periodic task can be changed by changing the task's period. To estimate the reward rates for running a task at different periods we will use a well-understood concept from optimal control theory, the performance index. We present and evaluate two algorithms for reallocating resources, which are of low complexity in order that they can be run quickly for fast recovery from failure. We also consider transient scheduling effects of changing periods and moving tasks when reallocating resources. By simulation, we show that the algorithms provide results that are close to optimal with randomly generated task sets. We demonstrate the calculation of reward rates for different frequencies of an example application task, and also demonstrate the calculation of the reward rate for a shadow task for the example application task.","PeriodicalId":124408,"journal":{"name":"Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128970970","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 72
An approach to task attribute assignment for uniprocessor systems 单处理器系统任务属性分配的一种方法
Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99 Pub Date : 1999-06-09 DOI: 10.1109/EMRTS.1999.777449
I. Bate, A. Burns
{"title":"An approach to task attribute assignment for uniprocessor systems","authors":"I. Bate, A. Burns","doi":"10.1109/EMRTS.1999.777449","DOIUrl":"https://doi.org/10.1109/EMRTS.1999.777449","url":null,"abstract":"The purpose of this paper is to investigate the issues related to task attribute assignment on an individual processor. The majority of papers on fixed priority scheduling make the assumption that tasks have their attributes (deadline, period, offset and priority) pre-assigned. This makes priority assignment trivial. However in practice, the system's timing requirements are specified and it is expected that the task attributes are synthesised from these. This paper is to present work that has been developed to solve this problem.","PeriodicalId":124408,"journal":{"name":"Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121900122","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 31
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书