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

1993 Proceedings Real-Time Systems Symposium最新文献

筛选
英文 中文
Validation of design for space launch vehicles 航天运载火箭设计验证
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393494
B. Jambor, G. Eger, Steven D. Layton
{"title":"Validation of design for space launch vehicles","authors":"B. Jambor, G. Eger, Steven D. Layton","doi":"10.1109/REAL.1993.393494","DOIUrl":"https://doi.org/10.1109/REAL.1993.393494","url":null,"abstract":"Interactions between fault tolerance and real-time requirements make the design of fault tolerant avionics for launch vehicles a challenge due to the necessity to handle time constrained execution of asynchronous events concurrently with potential faults. Results of designed experiments run on a prototype fault tolerant network are described. The shape of the probability density function of different tasks has been measured. Conclusions are drawn about guaranteeing task completion time.<<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":"115469111","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
Accounting for interrupt handling costs in dynamic priority task systems 动态优先级任务系统中中断处理成本的计算
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393497
K. Jeffay, Donald L. Stone
{"title":"Accounting for interrupt handling costs in dynamic priority task systems","authors":"K. Jeffay, Donald L. Stone","doi":"10.1109/REAL.1993.393497","DOIUrl":"https://doi.org/10.1109/REAL.1993.393497","url":null,"abstract":"In order to apply the results of formal studies of real-time task models, a practitioner must account for the effects of phenomena present in the implementation but not present in the formal model. We study the feasibility and schedulability problems for periodic tasks that must compete for the processor with interrupt handlers - tasks that are assumed to always have priority over application tasks. The emphasis in the analysis is on deadline driven scheduling methods. We develop conditions that solve the feasibility and schedulability problems and demonstrate that our solutions are computationally feasible. Lastly, we compare our analysis with others developed for static priority task systems.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"67 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":"116976427","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}
引用次数: 175
Scheduling and communication in MetaH 在meta中的调度和沟通
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393500
S. Vestal, P. Binns
{"title":"Scheduling and communication in MetaH","authors":"S. Vestal, P. Binns","doi":"10.1109/REAL.1993.393500","DOIUrl":"https://doi.org/10.1109/REAL.1993.393500","url":null,"abstract":"This paper describes certain aspects of an architecture description language (MetaH) and associated toolset used to specify, analyze, and automatically assemble software for real-time, fault-tolerant, secure, multi-processor systems. One goal in the design of this language and toolset was to provide design-time analysis that accurately characterizes the behavior of the actual implementation. Currently, our toolset consists of tools to automatically assemble the application software and to perform a real-time schedulability analysis for that application.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"54 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":"123673186","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}
引用次数: 36
How to get serializability for real-time transactions without having to pay for it 如何在不付费的情况下获得实时事务的序列化性
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393515
M. Graham
{"title":"How to get serializability for real-time transactions without having to pay for it","authors":"M. Graham","doi":"10.1109/REAL.1993.393515","DOIUrl":"https://doi.org/10.1109/REAL.1993.393515","url":null,"abstract":"A new approach to the problem of achieving serializability for real-time transaction systems is presented. It is shown that certain properties that have been claimed to be characteristic of real-time systems are sufficient in themselves to guarantee that the system will run serializably, without any extra effort having to be taken. These systems can be said to achieve serializability \"for free.\".<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"47 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":"124223126","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}
引用次数: 28
RTSL: a language for real-time schedulability analysis RTSL:用于实时可调度性分析的语言
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393489
Andre N. Fredette, R. Cleaveland
{"title":"RTSL: a language for real-time schedulability analysis","authors":"Andre N. Fredette, R. Cleaveland","doi":"10.1109/REAL.1993.393489","DOIUrl":"https://doi.org/10.1109/REAL.1993.393489","url":null,"abstract":"The paper develops a generalized approach to schedulability analysis that is mathematically founded in a process algebra called RTSL. Within RTSL one may describe the functional behavior, timing behavior, timing constraints (or deadlines), and scheduling discipline for real-time systems. The formal semantics of RTSL then allows the reachable state space of finite state systems to be automatically generated and searched for timing exceptions. We provide a generalized schedulability analysis technique to perform this state-based analysis.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"103 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":"116033622","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
A new Petri net based formalism for specification, design and analysis of real-time systems 一种新的基于Petri网的实时系统规范、设计和分析形式
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393487
G. Bruno, A. Castella, I. Pavesio, M. P. Pescarmona
{"title":"A new Petri net based formalism for specification, design and analysis of real-time systems","authors":"G. Bruno, A. Castella, I. Pavesio, M. P. Pescarmona","doi":"10.1109/REAL.1993.393487","DOIUrl":"https://doi.org/10.1109/REAL.1993.393487","url":null,"abstract":"Current Petri net based methods for modeling and design of real-time systems rely on formalisms that are either expressive or analyzable, but not both. Our goal is to provide a new formalism bridging the gap between these positions. We start from a well known result on timed marked graphs, extend it to more general nets, and enhance the resulting formalism expressiveness by means of a set of transition expansion rules, which also enable hierarchical net structuring. A detailed example is discussed.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"51 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":"127955116","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
Symbolic model checking for event-driven real-time systems 事件驱动实时系统的符号模型检查
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393518
Jin Yang, A. Mok, Farn Wang
{"title":"Symbolic model checking for event-driven real-time systems","authors":"Jin Yang, A. Mok, Farn Wang","doi":"10.1109/REAL.1993.393518","DOIUrl":"https://doi.org/10.1109/REAL.1993.393518","url":null,"abstract":"We consider symbolic model-checking for event-driven real-time systems. The concrete syntax of these systems is given in terms of a graphical programming language called Modechart. We propose a logic, Synchronous Real-Time Event logic (SREL) for specifying the timing properties of these systems. We then present a symbolic model-checking algorithm which checks a modechart against an SREL formula, and discuss several implementation issues. In particular, we give an efficient solution to the problem of encoding timing and event counting functions based on Binary Decision Diagram (BDD). This solution has been incorported into the SMV system v2.3 and has been able to achieve one to two orders of magnitude in speedup and space saving when compared to the solution based on the integer operations provided by the SMV system.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"54 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":"125142482","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}
引用次数: 37
The Spring scheduling co-processor: Design, use, and performance Spring调度协处理器:设计、使用和性能
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393510
D. Niehaus, K. Ramamritham, J. Stankovic, G. Wallace, C. Weems, W. Burleson, Jason Ko
{"title":"The Spring scheduling co-processor: Design, use, and performance","authors":"D. Niehaus, K. Ramamritham, J. Stankovic, G. Wallace, C. Weems, W. Burleson, Jason Ko","doi":"10.1109/REAL.1993.393510","DOIUrl":"https://doi.org/10.1109/REAL.1993.393510","url":null,"abstract":"We present a novel VLSI co-processor for real-time multiprocessor scheduling. The co-processor can be used for sophisticated static scheduling as well as for online scheduling using many different algorithms such as earliest deadline first, highest value first, or the Spring scheduling algorithm. When such an algorithm is used online it is important to assess the performance impact of the interface of the co-processor to the host system, in this case, the Spring kernel. We focus on the interface and its implications for overall scheduling performance. We show that the current VLSI chip speeds up the main portion of the scheduling operation by over three orders of magnitude and speeds up the overall scheduling operation 30 fold. The parallel VLSI architecture for scheduling is briefly presented. This architecture can be scaled for different numbers of tasks, resources, and internal word lengths. The implementation uses an advanced clocking scheme to allow further scaling using future IC technologies.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"136 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":"124885313","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}
引用次数: 34
Acquisition and service of temporal data for real-time plant monitoring 为工厂实时监测提供时间数据的获取和服务
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393509
H. Shimakawa, Hideji Ohnishi, I. Mizunuma, Morikazu Takegaki
{"title":"Acquisition and service of temporal data for real-time plant monitoring","authors":"H. Shimakawa, Hideji Ohnishi, I. Mizunuma, Morikazu Takegaki","doi":"10.1109/REAL.1993.393509","DOIUrl":"https://doi.org/10.1109/REAL.1993.393509","url":null,"abstract":"Data sampled from plants are registered as temporal data, combined with time stamps. We developed a real-time data server which periodically acquires temporal data and transmits them to clients for graphic presentation. The real-time data server consists of multi threads scheduled based on the rate monotonic theory. This paper explains the design of a real-time data server. The prediction for schedulability of it based on the rate monotonic theory has been verified with an experiment on an actual system.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"29 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":"122326483","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}
引用次数: 13
MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling MOCA:一种多处理器在线竞争实时系统调度算法
1993 Proceedings Real-Time Systems Symposium Pub Date : 1993-12-01 DOI: 10.1109/REAL.1993.393503
G. Koren, D. Shasha
{"title":"MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling","authors":"G. Koren, D. Shasha","doi":"10.1109/REAL.1993.393503","DOIUrl":"https://doi.org/10.1109/REAL.1993.393503","url":null,"abstract":"We study competitive on-line scheduling in multiprocessor real-time environments. In our model, every task has a deadline and a value that it obtains only if it completes by its deadline. A task can be assigned to any processor, all of which are equally powerful. The problem is to design an on-line scheduling algorithm (i.e., one in which the scheduler has no knowledge of a task until it is released) with worst case guarantees as to the total value obtained by the system. We study systems with two or more processors. We present an inherent limit on the best competitive guarantee that any on-line parallel real-time scheduler can give. Then we present a competitive algorithm that achieves a worst case guarantee which is within a small factor from the best possible guarantee in many cases. The models are a distributed system having a centralized scheduler as well as a shared memory multiprocessor.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"353 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":"131527492","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}
引用次数: 74
首页 上一页 下一页 尾页
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学术官方微信