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

Proceedings 13th Euromicro Conference on Real-Time Systems最新文献

筛选
英文 中文
Timing analysis of reliable real-time communication in CAN networks CAN网络中可靠实时通信的时序分析
Proceedings 13th Euromicro Conference on Real-Time Systems Pub Date : 2001-06-13 DOI: 10.1109/EMRTS.2001.934010
L. M. Pinho, F. Vasques
{"title":"Timing analysis of reliable real-time communication in CAN networks","authors":"L. M. Pinho, F. Vasques","doi":"10.1109/EMRTS.2001.934010","DOIUrl":"https://doi.org/10.1109/EMRTS.2001.934010","url":null,"abstract":"The Controller Area Network (CAN) is a fieldbus network with real-time capabilities. It is generally considered that CAN guarantees atomic multicast properties, through its extensive error detection/signalling mechanisms. However, there are error situations where messages can be delivered in duplicate by some receivers or delivered only by a subset of the receivers, leading to inconsistencies in the supported applications. In order to prevent such inconsistencies, a set of atomic multicast protocols is proposed, taking advantage of CAN synchronous properties to minimise its run-time overhead. This paper presents such set of protocols, focusing on the timing analysis of the supported reliable real-time communication. It demonstrates that, in spite of the extra stack of protocols, the real-time capabilities of CAN are preserved, since the predictability of message transfer is guaranteed.","PeriodicalId":292136,"journal":{"name":"Proceedings 13th Euromicro Conference on Real-Time Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116618672","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
A new kernel approach for modular real-time systems development 模块化实时系统开发的一种新的内核方法
Proceedings 13th Euromicro Conference on Real-Time Systems Pub Date : 2001-06-13 DOI: 10.1109/EMRTS.2001.934032
Paolo Gai, Luca Abeni, Massimiliano Giorgi, G. Buttazzo
{"title":"A new kernel approach for modular real-time systems development","authors":"Paolo Gai, Luca Abeni, Massimiliano Giorgi, G. Buttazzo","doi":"10.1109/EMRTS.2001.934032","DOIUrl":"https://doi.org/10.1109/EMRTS.2001.934032","url":null,"abstract":"This paper presents a dynamic configurable kernel architecture designed for supporting a simple implementation, integration and evaluation of scheduling algorithms. The main goal of the proposed architecture is to provide a platform for fast prototyping scheduling algorithms both for the CPU and for the devices. The kernel is fully modular in terms of scheduling policies, aperiodic servers, and concurrency control protocols, allowing applications to be developed independently from a particular system configuration. Finally, the system is compliant with the POSIX 1003.13 PSE52 specifications to simplify porting of application code developed for other POSIX compliant kernels.","PeriodicalId":292136,"journal":{"name":"Proceedings 13th Euromicro Conference on Real-Time Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134445377","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}
引用次数: 127
MSC/sup +/: From requirement to prototyped systems MSC/sup +/:从需求到原型系统
Proceedings 13th Euromicro Conference on Real-Time Systems Pub Date : 2001-06-13 DOI: 10.1109/EMRTS.2001.934013
M. Belachew, R. Shyamasundar
{"title":"MSC/sup +/: From requirement to prototyped systems","authors":"M. Belachew, R. Shyamasundar","doi":"10.1109/EMRTS.2001.934013","DOIUrl":"https://doi.org/10.1109/EMRTS.2001.934013","url":null,"abstract":"Message Sequence Charts (MSCs) have gained wide acceptance for scenario-based specification of component behaviors. MSCs are very useful during requirements capture phase of the software development process and reveal errors in requirement specifications when used in early stages. As MSCs have found widespread usage, there have been several extensions to overcome its' shortcomings for a spectrum of applications keeping the rationale of MSCs invariant. In this paper, we propose (a) An extension of hierarchical MSCs (hMSC for short), called MSC/sup +/, keeping in view the need of complex reactive system specifications; it has new additional features such as watching (preemptive) construct, generalized coregions, and includes features for the specifications of live and forbidden scenarios. (b) A formal translation of MSC/sup +/, to the synchronous language ESTEREL is also provided, This feature enables validating requirement specifications and also to obtain a prototype for synchronous MSC/sup +/ specifications. Apart from obtaining a prototype, the translation of MSC/sup +/ to ESTEREL (that has clean and mathematical semantics) provides a clear semantic definition for the synchronous MSC/sup +/ specifications, In the paper, we describe, the design and implementation of MSC/sup +/ followed by the translation of MSC/sup +/, to ESTEREL leading to prototyping of systems. Examples are used to highlight characteristic features of the language, system and applications.","PeriodicalId":292136,"journal":{"name":"Proceedings 13th Euromicro Conference on Real-Time Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132526006","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}
引用次数: 5
Three obstacles to flexible scheduling 灵活调度的三个障碍
Proceedings 13th Euromicro Conference on Real-Time Systems Pub Date : 2001-06-13 DOI: 10.1109/EMRTS.2001.933990
G. Bernat, A. Burns
{"title":"Three obstacles to flexible scheduling","authors":"G. Bernat, A. Burns","doi":"10.1109/EMRTS.2001.933990","DOIUrl":"https://doi.org/10.1109/EMRTS.2001.933990","url":null,"abstract":"The key to the next generation real-time systems is flexible scheduling mechanisms that guarantee hard deadlines and use available spare resources to maximise total system utility. This is a multicriteria scheduling problem. It is argued that common approaches like eager slack usage and mandatory first schemes are not only not optimal but nor adequate for a wide class of process models. It is also shown that a late acceptance test model is preferable to an early acceptance test model due to the uncertainty of future behaviour of the system. The discussion is complemented with simulation results.","PeriodicalId":292136,"journal":{"name":"Proceedings 13th Euromicro Conference on Real-Time Systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114585053","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}
引用次数: 6
Worst-case execution time analysis of the RTEMS real-time operating system RTEMS实时操作系统的最坏情况执行时间分析
Proceedings 13th Euromicro Conference on Real-Time Systems Pub Date : 2001-06-13 DOI: 10.1109/EMRTS.2001.934029
Antoine Colin, I. Puaut
{"title":"Worst-case execution time analysis of the RTEMS real-time operating system","authors":"Antoine Colin, I. Puaut","doi":"10.1109/EMRTS.2001.934029","DOIUrl":"https://doi.org/10.1109/EMRTS.2001.934029","url":null,"abstract":"An important issue in building operating systems for hard real-time applications is to compute the worst-case execution times (WCET) of the operating system activities. Traditionally, this has been achieved by an exhaustive testing of the operating system, with a careful attention on the testing conditions to reproduce the worst-case execution scenario. In this paper we explore the alternative approach of using static analysis to predict off-line the WCET of the system calls of a real-time kernel, the RTEMS kernel. We give qualitative and quantitative results on the analysis of RTEMS, and draw some conclusions on the extent to which static analysis can be used on operating system code.","PeriodicalId":292136,"journal":{"name":"Proceedings 13th Euromicro Conference on Real-Time Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133027813","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}
引用次数: 93
A modular and retargetable framework for tree-based WCET analysis 基于树的WCET分析的模块化和可重定向框架
Proceedings 13th Euromicro Conference on Real-Time Systems Pub Date : 2001-06-13 DOI: 10.1109/EMRTS.2001.933995
Antoine Colin, I. Puaut
{"title":"A modular and retargetable framework for tree-based WCET analysis","authors":"Antoine Colin, I. Puaut","doi":"10.1109/EMRTS.2001.933995","DOIUrl":"https://doi.org/10.1109/EMRTS.2001.933995","url":null,"abstract":"A fundamental requirement for hard real-time systems is the knowledge of tasks worst case execution times (WCET). Static worst-case execution time analysis (WCET analysis), thanks to the static analysis of a piece of source code, returns an upper bound of the time required to execute it on a given hardware. Taking into account modern architectural features makes it possible to determine tight WCET bounds. Several mechanisms that use modeling and simulate some architectural feature behaviors such as instruction cache, branch prediction mechanism and pipeline have been proposed in the literature. These methods have often been designed independently from each other which leads to an integration issue. This paper proposes to formalize (through data structures) three techniques for static simulation of instruction cache, pipeline and branch prediction in order to gather them in an integrated static WCET analysis framework. Performance improvements due to the integrated approach are also given.","PeriodicalId":292136,"journal":{"name":"Proceedings 13th Euromicro Conference on Real-Time Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125071368","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}
引用次数: 137
An effective schedulability analysis for fault-tolerant hard real-time systems 容错硬实时系统的可调度性分析
Proceedings 13th Euromicro Conference on Real-Time Systems Pub Date : 2001-06-13 DOI: 10.1109/EMRTS.2001.934034
George Lima, A. Burns
{"title":"An effective schedulability analysis for fault-tolerant hard real-time systems","authors":"George Lima, A. Burns","doi":"10.1109/EMRTS.2001.934034","DOIUrl":"https://doi.org/10.1109/EMRTS.2001.934034","url":null,"abstract":"We propose worst-case response time schedulability analysis for fault-tolerant hard real-time systems which takes into account the effects of temporary faults. The major contribution of our approach is to consider the recovery of tasks running with higher priorities. This characteristic is very useful since faulty tasks certainly have a shorter period of time to meet their deadlines. Due to its flexibility and simplicity, the proposed approach provides an effective schedulability analysis, where system predictability can be fully guaranteed.","PeriodicalId":292136,"journal":{"name":"Proceedings 13th Euromicro Conference on Real-Time Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127085341","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}
引用次数: 17
A hyperbolic bound for the rate monotonic algorithm 速率单调算法的双曲界
Proceedings 13th Euromicro Conference on Real-Time Systems Pub Date : 2001-06-13 DOI: 10.1109/EMRTS.2001.934000
Enrico Bini, G. Buttazzo, G. Buttazzo
{"title":"A hyperbolic bound for the rate monotonic algorithm","authors":"Enrico Bini, G. Buttazzo, G. Buttazzo","doi":"10.1109/EMRTS.2001.934000","DOIUrl":"https://doi.org/10.1109/EMRTS.2001.934000","url":null,"abstract":"In this paper we propose a novel schedulability analysis for verifying the feasibility of large periodic task sets under the rate monotonic algorithm, when the exact test cannot be applied on line due to prohibitively long execution times. The proposed test has the same complexity as the original Liu and Layland bound but it is less pessimistic, so allowing to accept task sets that would be rejected using the original approach. The performance of the proposed approach is evaluated with respect to the classical Liu and Layland method, and theoretical bounds are derived as a function of n (the number of tasks) and for the limit case of n tending to infinity. The analysis is also extended to include aperiodic servers and blocking times due to concurrency control protocols. Extensive simulations on synthetic tasks sets are presented to compare the effectiveness of the proposed test with respect to the Liu and Layland method and the exact response time analysis.","PeriodicalId":292136,"journal":{"name":"Proceedings 13th Euromicro Conference on Real-Time Systems","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122848261","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}
引用次数: 132
Analysis of a simple model for non-preemptive blocking-free scheduling 非抢占式无阻塞调度的简单模型分析
Proceedings 13th Euromicro Conference on Real-Time Systems Pub Date : 2001-06-13 DOI: 10.1109/ECRTS.2001.10005
L. Almeida, J. Fonseca
{"title":"Analysis of a simple model for non-preemptive blocking-free scheduling","authors":"L. Almeida, J. Fonseca","doi":"10.1109/ECRTS.2001.10005","DOIUrl":"https://doi.org/10.1109/ECRTS.2001.10005","url":null,"abstract":"Non-preemptive scheduling is known for its lower efficiency in meeting temporal constraints when compared to preemptive scheduling. However, it is still used in certain cases such as in message scheduling over serial broadcast buses and in light multi-tasking kernels for embedded systems based on simple microprocessors. These cases are typically found in control applications requiring the periodic execution (or transmission) of a set of tasks (or messages) with low jitter. This paper refers to a simple execution strategy based on synchronised timetriggering and non-preemptive scheduling that allows to eliminate the blocking factor commonly associated to non-preemption and thus reduce activation jitter. The elimination of such blocking factor is achieved by using inserted idle-time. The paper focuses on the schedulability analysis of a generic task set executed according to the referred model. In one part, a specific response time-based analysis is presented which supports, under worst-case assumptions, a necessary and sufficient schedulability assessment. In a following part, the paper presents a general theorem that allows to adapt the existing analysis for preemptive scheduling to the referred model. In particular, this theorem allows to develop adequate utilization bounds for guaranteed schedulability, based on the well known bounds for ratemonotonic analysis.","PeriodicalId":292136,"journal":{"name":"Proceedings 13th Euromicro Conference on Real-Time Systems","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124930113","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}
引用次数: 30
Test generation for time critical systems: Tool and case study 时间关键系统的测试生成:工具和案例研究
Proceedings 13th Euromicro Conference on Real-Time Systems Pub Date : 2001-06-13 DOI: 10.1109/EMRTS.2001.934021
B. Nielsen, A. Skou
{"title":"Test generation for time critical systems: Tool and case study","authors":"B. Nielsen, A. Skou","doi":"10.1109/EMRTS.2001.934021","DOIUrl":"https://doi.org/10.1109/EMRTS.2001.934021","url":null,"abstract":"Generating timed test sequences by hand is error-prone and time consuming, and it is easy to overlook important scenarios. The paper presents a tool based on formal methods that automatically computes a test suite for conformance testing of time critical systems. The generated tests are selected on the basis of a coverage criterion of the specification. The tool guarantees production of sound test cases only, and is able to produce a complete covering test suite. We demonstrate the tool by generating test cases for the Philips Audio Protocol.","PeriodicalId":292136,"journal":{"name":"Proceedings 13th Euromicro Conference on Real-Time Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129481348","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}
引用次数: 25
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信