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

1994 Proceedings Real-Time Systems Symposium最新文献

筛选
英文 中文
Efficient aperiodic service under earliest deadline scheduling 最早期限调度下的高效非周期服务
1994 Proceedings Real-Time Systems Symposium Pub Date : 1994-12-07 DOI: 10.1109/REAL.1994.342735
M. Spuri, G. Buttazzo
{"title":"Efficient aperiodic service under earliest deadline scheduling","authors":"M. Spuri, G. Buttazzo","doi":"10.1109/REAL.1994.342735","DOIUrl":"https://doi.org/10.1109/REAL.1994.342735","url":null,"abstract":"We present four new on-line algorithms for servicing soft aperiodic requests in real-time systems, where a set of hard periodic tasks is scheduled using the Earliest Deadline First (EDF) algorithm. All the proposed solutions can achieve full processor utilization and enhance aperiodic responsiveness, still guaranteeing the execution of the periodic tasks. Operation of the algorithms, performance, schedulability analysis, and implementation complexity are discussed and compared with classical alternative solutions, such as background and polling service. Extensive simulations show that algorithms with contained run-time overhead present nearly optimal responsiveness. A valuable contribution of this work is to provide the real-time system designer with a wide range of practical solutions which allow to balance efficiency against implementation complexity.<<ETX>>","PeriodicalId":374952,"journal":{"name":"1994 Proceedings Real-Time Systems Symposium","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134183937","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}
引用次数: 277
Real-time communication services in a DQDB network DQDB网络中的实时通信服务
1994 Proceedings Real-Time Systems Symposium Pub Date : 1994-12-07 DOI: 10.1109/REAL.1994.342711
R. L. R. Carmo, F. Vasques, G. Juanole
{"title":"Real-time communication services in a DQDB network","authors":"R. L. R. Carmo, F. Vasques, G. Juanole","doi":"10.1109/REAL.1994.342711","DOIUrl":"https://doi.org/10.1109/REAL.1994.342711","url":null,"abstract":"Addresses the problem of transmitting real-time periodic traffic in a DQDB network. In a DQDB network, connection-oriented isochronous services use the pre-arbitrated (PA) access. The standard specifies that isochronous connections must have guaranteed periodic bandwidth but mechanisms to provide it, such as the slot allocation scheme, are not described. We propose a real-time service provider (RTSP) based on the use of the PA access. The RTSP consists of an off-line centralized scheduling algorithm and an on-line mode change algorithm which allows to take into account load changes. Means are also provided to guarantee a minimum fairness level for the asynchronous traffic.<<ETX>>","PeriodicalId":374952,"journal":{"name":"1994 Proceedings Real-Time Systems Symposium","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116506064","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}
引用次数: 10
Mechanisms for enhancing the flexibility and utility of hard real-time systems 增强硬实时系统的灵活性和实用性的机制
1994 Proceedings Real-Time Systems Symposium Pub Date : 1994-12-07 DOI: 10.1109/REAL.1994.342734
N. Audsley, Robert I. Davis, A. Burns
{"title":"Mechanisms for enhancing the flexibility and utility of hard real-time systems","authors":"N. Audsley, Robert I. Davis, A. Burns","doi":"10.1109/REAL.1994.342734","DOIUrl":"https://doi.org/10.1109/REAL.1994.342734","url":null,"abstract":"Adaptive and dynamic behaviour is seen as one of the key characteristics of next generation hard real-time systems. Whilst fixed priority pre-emptive scheduling is rapidly becoming a de facto standard in real-time systems engineering, it remains inflexible in its purest form. One method of increasing flexibility is via the incorporation of optional components into processes with hard deadlines. Such components are not guaranteed off-line, but may be accepted at run-time if sufficient spare capacity becomes available. This paper describes new mechanisms which are required to schedule effectively optional components: mechanisms which enable spare capacity to be detected early and on-line guarantees to be given.<<ETX>>","PeriodicalId":374952,"journal":{"name":"1994 Proceedings Real-Time Systems Symposium","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117011186","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}
引用次数: 46
Response-time bounds of rule-based programs under rule priority structure 规则优先级结构下基于规则程序的响应时间边界
1994 Proceedings Real-Time Systems Symposium Pub Date : 1994-12-07 DOI: 10.1109/REAL.1994.342722
Rwo-Hsi Wang, A. Mok
{"title":"Response-time bounds of rule-based programs under rule priority structure","authors":"Rwo-Hsi Wang, A. Mok","doi":"10.1109/REAL.1994.342722","DOIUrl":"https://doi.org/10.1109/REAL.1994.342722","url":null,"abstract":"A key index of the performance of a rule-based program used in real-time monitoring and control is its response time, defined by the maximum number of rule firings before a fixed point of the program is reached from a start state. Previous work in computing the response-time bounds for rule-based programs assumes that if two rules are enabled, then either one of them may be scheduled for firing. This assumption may be too conservative in the case when programmers choose to impose a priority structure on the set of rules. In this paper, we discuss how to get tighter bounds by taking rule-priority information into account. We show that the rule-suppression relation we previously introduced can be extended to incorporate rule-priority information. A bound-derivation algorithm for programs whose potential-trigger relations satisfy an acyclicity condition is presented, followed by its correctness proof and an analysis example.<<ETX>>","PeriodicalId":374952,"journal":{"name":"1994 Proceedings Real-Time Systems Symposium","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115191419","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}
引用次数: 14
Multiple route real-time channels in packet-switched networks 分组交换网络中的多路由实时信道
1994 Proceedings Real-Time Systems Symposium Pub Date : 1994-12-07 DOI: 10.1109/REAL.1994.342728
Kai Chiu Kwan, P. Ramanathan
{"title":"Multiple route real-time channels in packet-switched networks","authors":"Kai Chiu Kwan, P. Ramanathan","doi":"10.1109/REAL.1994.342728","DOIUrl":"https://doi.org/10.1109/REAL.1994.342728","url":null,"abstract":"A real-time channel is a communication mechanism commonly used to guarantee timely delivery of messages between two nodes of a distributed system. It is established at the request of an application task. In the request, the task specifies its worst-case traffic pattern and the required timing constraints. The system accepts the request only if it can guarantee the requested timing constraints without jeopardizing the guarantees provided to the established channels. The main objective of the scheme proposed in this paper is to increase the fraction of channel establishment requests accepted by the system. The proposed scheme increases the fraction of accepted requests by exploiting the existence of multiple routes between two nodes of a distributed system. In particular, unlike existing schemes, it carefully partitions a message and sends the message partitions along different routes to guarantee their timely delivery. In partitioning the message, it also ensures that the overhead of re-sequencing the partitions sent along different routes is minimal. The end result is a better channel establishment procedure for guaranteeing sequenced, timely delivery of messages in a real-time application.<<ETX>>","PeriodicalId":374952,"journal":{"name":"1994 Proceedings Real-Time Systems Symposium","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126975566","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
Applying RMA to improve a high-speed, real time data acquisition system 应用RMA改进高速实时数据采集系统
1994 Proceedings Real-Time Systems Symposium Pub Date : 1994-12-07 DOI: 10.1109/REAL.1994.342720
D. D. Val, Á. Viña
{"title":"Applying RMA to improve a high-speed, real time data acquisition system","authors":"D. D. Val, Á. Viña","doi":"10.1109/REAL.1994.342720","DOIUrl":"https://doi.org/10.1109/REAL.1994.342720","url":null,"abstract":"Unlike other real-time systems, data acquisition applications spend most of their time performing synchronous and asynchronous I/O operations. This fact, that affects the tasks' abilities to meet deadlines, can be modelled with some extensions to the classic rate monotonic schedulability test. In this paper, we address this issue by investigating a case study for the application of rate monotonic analysis (RMA) to data acquisition systems. We describe a technique for modelling tasks that perform asynchronous I/O at the end of their executing period; and we also show the logistic and technical problems that can arise when applying RMA at different stages during the development process of an application. We illustrate our ideas with a real-time data acquisition system that we have developed, characterized by a very heterogeneous architecture whose technological components have been pushed to the limits of their performance and capacity.<<ETX>>","PeriodicalId":374952,"journal":{"name":"1994 Proceedings Real-Time Systems Symposium","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127226172","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
Analysing real-time communications: controller area network (CAN) 实时通信分析:控制器局域网(CAN)
1994 Proceedings Real-Time Systems Symposium Pub Date : 1994-12-07 DOI: 10.1109/REAL.1994.342710
K. Tindell, H. Hanssmon, A. Wellings
{"title":"Analysing real-time communications: controller area network (CAN)","authors":"K. Tindell, H. Hanssmon, A. Wellings","doi":"10.1109/REAL.1994.342710","DOIUrl":"https://doi.org/10.1109/REAL.1994.342710","url":null,"abstract":"The increasing use of communication networks in time-critical applications presents engineers with fundamental problems with the determination of response times of communicating distributed processes. Although there has been some work on the analysis of communication protocols, most of this is for idealised networks. Experience with single-processor scheduling analysis has shown that models which abstract away from implementation details are at best very pessimistic, and at worst lead to an unschedulable system being deemed schedulable. In this paper, we derive an idealised scheduling analysis for the CAN real-time bus, and then study two actual interface chips to see how the analysis can be applied.<<ETX>>","PeriodicalId":374952,"journal":{"name":"1994 Proceedings Real-Time Systems Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130860116","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}
引用次数: 467
Deterministic upperbounds of the worst-case execution times of cached programs 缓存程序的最坏情况执行时间的确定性上界
1994 Proceedings Real-Time Systems Symposium Pub Date : 1994-12-07 DOI: 10.1109/REAL.1994.342717
Jyh-Charn S. Liu, Hung-ju Lee
{"title":"Deterministic upperbounds of the worst-case execution times of cached programs","authors":"Jyh-Charn S. Liu, Hung-ju Lee","doi":"10.1109/REAL.1994.342717","DOIUrl":"https://doi.org/10.1109/REAL.1994.342717","url":null,"abstract":"Proposes techniques to derive the worst-case execution time (WCET) of cached programs. We focus on the analysis of one single program run on a direct-mapped cache, where no external interference could occur. The analysis complexity of the WCET of (un)cached programs is NP-complete. For nested loops, we derive some sufficient conditions in deriving the deterministic bounds of their WCET. These sufficient conditions can be used to make trade-offs between tightness of the WCET bounds and their search time.<<ETX>>","PeriodicalId":374952,"journal":{"name":"1994 Proceedings Real-Time Systems Symposium","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128129096","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}
引用次数: 44
The generalized railroad crossing: a case study in formal verification of real-time systems 广义铁路道口:实时系统形式化验证的案例研究
1994 Proceedings Real-Time Systems Symposium Pub Date : 1994-11-01 DOI: 10.1109/REAL.1994.342724
C. Heitmeyer, N. Lynch
{"title":"The generalized railroad crossing: a case study in formal verification of real-time systems","authors":"C. Heitmeyer, N. Lynch","doi":"10.1109/REAL.1994.342724","DOIUrl":"https://doi.org/10.1109/REAL.1994.342724","url":null,"abstract":"A new solution to the generalized railroad crossing problem, based on timed automata, invariants and simulation mappings, is presented and evaluated. The solution shows formally the correspondence between four system descriptions: an axiomatic specification, an operational specification, a discrete system implementation, and a system implementation that works with a continuous gate model.<<ETX>>","PeriodicalId":374952,"journal":{"name":"1994 Proceedings Real-Time Systems Symposium","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127405684","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}
引用次数: 171
Computing quantitative characteristics of finite-state real-time systems 有限状态实时系统的计算定量特征
1994 Proceedings Real-Time Systems Symposium Pub Date : 1994-05-01 DOI: 10.1109/REAL.1994.342709
S. Campos, E. Clarke, W. Marrero, M. Minea, H. Hiraishi
{"title":"Computing quantitative characteristics of finite-state real-time systems","authors":"S. Campos, E. Clarke, W. Marrero, M. Minea, H. Hiraishi","doi":"10.1109/REAL.1994.342709","DOIUrl":"https://doi.org/10.1109/REAL.1994.342709","url":null,"abstract":"Presents a general method for computing quantitative information about finite-state real-time systems. We have developed algorithms that compute exact bounds on the delay between two specified events and on the number of occurrences of an event in a given interval. This technique allows us to determine performance measures such as schedulability, response time, and system load. Our algorithms produce more detailed information than traditional methods. This information leads to a better understanding of system behavior, in addition to determining its correctness. The algorithms presented in this paper are efficiently implemented using binary decision diagrams and have been incorporated into the SMV symbolic model verifier. Using this method, we have verified a model of an aircraft control system with 10/sup 15/ states. The results obtained demonstrate that our method can be successfully applied in the verification of real-time system designs.<<ETX>>","PeriodicalId":374952,"journal":{"name":"1994 Proceedings Real-Time Systems Symposium","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115606281","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
首页 上一页 下一页 尾页
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学术官方微信