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

1993 Proceedings Real-Time Systems Symposium最新文献

筛选
英文 中文
Reliability of event-triggered task activation for hard real-time systems 硬实时系统中事件触发任务激活的可靠性
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393498
S. Poledna
{"title":"Reliability of event-triggered task activation for hard real-time systems","authors":"S. Poledna","doi":"10.1109/REAL.1993.393498","DOIUrl":"https://doi.org/10.1109/REAL.1993.393498","url":null,"abstract":"Real-time systems which have to respond to environmental state changes within a very short latency period are often using event-triggered task activation. If the system has to work even in case of sensor failures, event-triggered task activation is not reliable. Task activations may occur too early, thus causing a system overload, they may occur too late or are entirely omitted. To overcome these problems the task-splitting model is introduced, which integrates fault tolerance into the analysis and construction of hard real-time systems. This model controls event-triggered task activations to handle faults while guaranteeing timely reponse to changes of environmental states. The task-splitting model is independent of any particular scheduling algorithm, it is based on a general task model. The result of this work has influenced the design of a robust engine controller of the next generation.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132322135","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}
引用次数: 0
Really visual temporal reasoning 真正的视觉时间推理
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393490
Y. S. Ramakrishna, P. Melliar-Smith, L. Moser, L. Dillon, G. Kutty
{"title":"Really visual temporal reasoning","authors":"Y. S. Ramakrishna, P. Melliar-Smith, L. Moser, L. Dillon, G. Kutty","doi":"10.1109/REAL.1993.393490","DOIUrl":"https://doi.org/10.1109/REAL.1993.393490","url":null,"abstract":"Real-Time Future Interval Logic (RTFIL) is a visual logic with formulae that resemble timing diagrams. It is a dense real-time temporal logic that is based on two simple temporal primitives: interval modalities for the purely qualitative part and duration predicates for the quantitative part. We present the logic, and illustrate its use in specifying the railroad crossing example and in proving some of its properties. The logic is decidable by reduction to the emptiness problem of Timed Buchi Automata. An automated theorem prover based on this decision procedure has been implemented as part of a graphical proof environment. The proofs of the railroad crossing example have been verified using this theorem prover. An automated theorem prover and a graphical specification language greatly facilitate the task of verifying real-time proofs. This convenience apart, RTFIL is invariant under real-time stuttering and does not admit instantaneous states. These properties facilitate proof methods based on abstraction and refinement.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124263013","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
The use of preemptive priority-based scheduling for space applications 在空间应用程序中使用基于优先级的抢占调度
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393492
C. Bailey, E. Fyfe, T. Vardanega, A. Wellings
{"title":"The use of preemptive priority-based scheduling for space applications","authors":"C. Bailey, E. Fyfe, T. Vardanega, A. Wellings","doi":"10.1109/REAL.1993.393492","DOIUrl":"https://doi.org/10.1109/REAL.1993.393492","url":null,"abstract":"In January 1991, the European Space Agency commissioned a study into the practicality of using process-based scheduling techniques in an on-board application environment, with Ada as the implementation language. The short paper summarizes the results of that study.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116599997","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}
引用次数: 15
The non-blocking write protocol NBW: A solution to a real-time synchronization problem 非阻塞写协议NBW:一种实时同步问题的解决方案
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393507
H. Kopetz, J. Reisinger
{"title":"The non-blocking write protocol NBW: A solution to a real-time synchronization problem","authors":"H. Kopetz, J. Reisinger","doi":"10.1109/REAL.1993.393507","DOIUrl":"https://doi.org/10.1109/REAL.1993.393507","url":null,"abstract":"The synchronization problem between a communication controller writing a data structure into a common memory and a set of concurrently executing real-time tasks reading this data structure is investigated. Two versions of an adaptable new non-blocking protocol are presented and a schedulability analysis for a task set using these protocols is given.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123823030","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}
引用次数: 131
Performance evaluation of a bandwidth allocation scheme for guaranteeing synchronous messages with arbitrary deadlines in an FDDI network FDDI网络中保证任意截止日期同步消息的带宽分配方案的性能评估
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393517
S. Kamat, Nicholas Malcolm, Wei Zhao
{"title":"Performance evaluation of a bandwidth allocation scheme for guaranteeing synchronous messages with arbitrary deadlines in an FDDI network","authors":"S. Kamat, Nicholas Malcolm, Wei Zhao","doi":"10.1109/REAL.1993.393517","DOIUrl":"https://doi.org/10.1109/REAL.1993.393517","url":null,"abstract":"We study the performance of FDDI networks in terms of their guarantee probability, i.e., the probability that a set of synchronous messages are guaranteed to meet their deadlines. Traditional techniques such as queuing analysis cannot be directly used to derive the guarantee probability. To counter this problem, we develop a new geometric model of schedulability. Based on this model, we obtain a numerical method to compute the exact values of the guarantee probability. A closed-form approximation for the guarantee probability is also derived, and is shown to be relatively accurate and computationally efficient. The network performance is then systematically examined in terms of the guarantee probability. We find that there is a high probability that a randomly chosen message set can be guaranteed even when the real-time traffic is increased beyond the worst case achievable utilization bound. Hence, FDDI networks are applicable for real-time applications in a wide range of loading conditions.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126522705","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
Implementation of a synchronous execution machine on Chorus micro-kernel Chorus微内核上同步执行机的实现
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393501
R. Bernhard, L. Hazard, F. Horn, J. Stefani
{"title":"Implementation of a synchronous execution machine on Chorus micro-kernel","authors":"R. Bernhard, L. Hazard, F. Horn, J. Stefani","doi":"10.1109/REAL.1993.393501","DOIUrl":"https://doi.org/10.1109/REAL.1993.393501","url":null,"abstract":"The programming of real-time systems with synchronous languages requires an infrastructure support, which we call a \"synchronous execution machine\". The role of a synchronous execution machine is to manage the interfacing of synchronous programs with their asynchronous environment, while respecting their synchronous semantics. Using the ESTEREL language as an example, we give a formal description of a generic execution machine and we discuss some aspects of its implementation on the Chorus distributed operating system micro-kernel.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128375906","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
Integrated management of priority inversion in Real-Time Mach 实时Mach中优先级反演的集成管理
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393508
T. Nakajima, Takuro Kitayama, H. Arakawa, H. Tokuda
{"title":"Integrated management of priority inversion in Real-Time Mach","authors":"T. Nakajima, Takuro Kitayama, H. Arakawa, H. Tokuda","doi":"10.1109/REAL.1993.393508","DOIUrl":"https://doi.org/10.1109/REAL.1993.393508","url":null,"abstract":"Synchronization and communication are two common sources of priority inversion which may make the behavior of systems unpredictable and unanalyzable. In microkernel-based systems, they are heavily used for building operating system servers and decomposing applications into several tasks. The management of priorities in IPC and synchronization should be integrated using a uniform mechanism since priority inversion occurs if such integration is not supported. Also, a highly preemptable server structure should be provided because the execution in a server may take up too much time. We propose an integrated real-time resource management model, and a real-time server model which solve the above problems. We implemented and evaluated the models in Real-Time Mach using a uniform mechanism. Our approach enables us to build operating system servers and to decompose applications into several tasks without incurring priority inversion.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130384549","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}
引用次数: 53
Architectural considerations in the design of real-time kernels 实时内核设计中的体系结构考虑
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393506
S. Lo, N. Hutchinson, S. Chanson
{"title":"Architectural considerations in the design of real-time kernels","authors":"S. Lo, N. Hutchinson, S. Chanson","doi":"10.1109/REAL.1993.393506","DOIUrl":"https://doi.org/10.1109/REAL.1993.393506","url":null,"abstract":"A vital role of real-time kernels is to help applications meet real-time requirements. The common approach in existing kernel design methodology has been to replace the scheduler in the kernel according to the needs of the application. As new real-time applications with unconventional scheduling requirements continue to emerge, constantly changing the kernel results in it becoming less stable and less maintainable. We discuss the modularity problems associated with this adhoc approach. We propose a kernel design which solves many of the problems by providing a common real-time task model for all real-time applications. This model allows for much more flexibility in the implementation of application-level schedulers and at the same time encourages modularity in kernel and application design. The model has been implemented using the Mach 3.0 kernel as a development platform. The flexibility of our solution is illustrated by considering the demands placed on the kernel by a modern multimedia application.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"268 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123112958","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
Queuing spin lock algorithms to support timing predictability 排队自旋锁算法支持时间可预测性
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393505
Travis S. Craig
{"title":"Queuing spin lock algorithms to support timing predictability","authors":"Travis S. Craig","doi":"10.1109/REAL.1993.393505","DOIUrl":"https://doi.org/10.1109/REAL.1993.393505","url":null,"abstract":"We introduce practical new algorithms for FIFO and priority-ordered spin locks on shared-memory multiprocessors with an atomic swap instruction. Different versions of these queuing spin locks are designed for machines with coherent-cache and NUMA memory models. We discuss extensions to provide nested lock acquisition, conditional locking, timeout of lock requests, and preemption waiters. These locks support predictable timing in the lowest kernel and user levels of time-line-scheduled and priority-scheduled real-time systems.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130209765","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}
引用次数: 71
HARTIK: A real-time kernel for robotics applications HARTIK:机器人应用的实时内核
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393499
G. Buttazzo
{"title":"HARTIK: A real-time kernel for robotics applications","authors":"G. Buttazzo","doi":"10.1109/REAL.1993.393499","DOIUrl":"https://doi.org/10.1109/REAL.1993.393499","url":null,"abstract":"This paper presents a hard real-time kernel, called HARTIK, specifically designed to handle robotics applications with predictable response time. The main relevant features of this kernel include: direct specification of time constraints, such as periods and deadlines; preemptive scheduling; coexistence of hard soft, and non real-time tasks, separation between time constraints and importance; deadline tolerance; dynamic guarantee of critical tasks; and graceful degradation in overload conditions. The functionality of the kernel is then shown by presenting a concrete example of a robot system that has to explore unknown objects by visual and force feedback.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131011474","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}
引用次数: 53
下一页 尾页
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学术官方微信