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

[1992] Proceedings Real-Time Systems Symposium最新文献

筛选
英文 中文
The Airplane Information Management System: an integrated real-time flight-deck control system 飞机信息管理系统:一个集成的实时飞行甲板控制系统
[1992] Proceedings Real-Time Systems Symposium Pub Date : 1992-12-02 DOI: 10.1109/REAL.1992.242654
K. Driscoll, K. Hoyme
{"title":"The Airplane Information Management System: an integrated real-time flight-deck control system","authors":"K. Driscoll, K. Hoyme","doi":"10.1109/REAL.1992.242654","DOIUrl":"https://doi.org/10.1109/REAL.1992.242654","url":null,"abstract":"Honeywell is completing design and will build hardware for the new Boeing 777 integrated Airplane Information Management System (AIMS). AIMS functions have time constraints from hard real-time to non-real-time, and criticality levels from flight critical to nonessential. The challenge is that these functions share time, memory, and input/output (I/O) on a redundant, distributed multiprocessor. An innovative offline scheduling tool and table driven bus protocol control data transfers and Ada process synchronization with verifiable resource allocation, latency control, and performance.<<ETX>>","PeriodicalId":158503,"journal":{"name":"[1992] Proceedings Real-Time Systems Symposium","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121873310","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
Preemptibility in real-time operating systems 实时操作系统中的抢占性
[1992] Proceedings Real-Time Systems Symposium Pub Date : 1992-12-02 DOI: 10.1109/REAL.1992.242674
C. W. Mercer, H. Tokuda
{"title":"Preemptibility in real-time operating systems","authors":"C. W. Mercer, H. Tokuda","doi":"10.1109/REAL.1992.242674","DOIUrl":"https://doi.org/10.1109/REAL.1992.242674","url":null,"abstract":"Real-time operating systems generally depend on some form of priority information for making scheduling decisions. Priorities may take the form of small integers or deadline times, for example, and the priorities indicate the preferred order for execution of the jobs. Unfortunately, most systems suffer from some degree of priority inversion where a high priority job must wait for a lower priority job to execute. The authors consider the nature of the nonpreemptible code sections, called critical sections or critical regions, which give rise to this priority inversion in the context of a soft real-time operating system where average response time for different priority classes is the primary performance metric. An analytical model is described which is used to illustrate how critical regions may affect the time-constrained jobs in a multimedia (soft real-time) task set.<<ETX>>","PeriodicalId":158503,"journal":{"name":"[1992] Proceedings Real-Time Systems Symposium","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128354772","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
An upper and a lower bound for tick synchronization 节拍同步的上限和下限
[1992] Proceedings Real-Time Systems Symposium Pub Date : 1992-12-02 DOI: 10.1109/REAL.1992.242656
M. Mavronicolas
{"title":"An upper and a lower bound for tick synchronization","authors":"M. Mavronicolas","doi":"10.1109/REAL.1992.242656","DOIUrl":"https://doi.org/10.1109/REAL.1992.242656","url":null,"abstract":"The tick synchronization problem is defined and studied in the semisynchronous complete network with n processes. An algorithm for the tick synchronization problem enables each process to make an estimate of real time close enough to those of other processes. It is assumed that the (real) time for message delivery is at most d and the time between any two consecutive signs of any process is in the interval (c, 1), where 0<c<or=1. The author defines the precision of a tick synchronization algorithm to be the maximum difference between estimates of real time made by different processes, and proposes it as a worst-case performance measure.<<ETX>>","PeriodicalId":158503,"journal":{"name":"[1992] Proceedings Real-Time Systems Symposium","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117033363","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}
引用次数: 1
A retargetable technique for predicting execution time 预测执行时间的可重定向技术
[1992] Proceedings Real-Time Systems Symposium Pub Date : 1992-12-02 DOI: 10.1109/REAL.1992.242675
M. Harmon, T. Baker, D. Whalley
{"title":"A retargetable technique for predicting execution time","authors":"M. Harmon, T. Baker, D. Whalley","doi":"10.1109/REAL.1992.242675","DOIUrl":"https://doi.org/10.1109/REAL.1992.242675","url":null,"abstract":"A novel technique for predicting point-to-point execution times on contemporary microprocessors is presented. It uses machine-description rules, similar to those that have proven useful for code generation and peephole optimization, to translate compiled object code into a sequence of very low-level instructions. The stream of micro-instructions is then analyzed for tuning, via a three-level pattern matching scheme. The timing tool is currently predicting execution time of code segments targeted for the Motorola 68020 and Intel 80386 processor. The timing tool has been integrated with a version of the vpo C compiler and the ease environment. A prototype has been built and preliminary tests are very promising.<<ETX>>","PeriodicalId":158503,"journal":{"name":"[1992] Proceedings Real-Time Systems Symposium","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125025417","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}
引用次数: 94
Performance effects of information sharing in a distributed multiprocessor real-time scheduler 分布式多处理器实时调度器中信息共享的性能影响
[1992] Proceedings Real-Time Systems Symposium Pub Date : 1992-12-02 DOI: 10.1109/REAL.1992.242677
Hongyi Zhou, K. Schwan, I. Akyildiz
{"title":"Performance effects of information sharing in a distributed multiprocessor real-time scheduler","authors":"Hongyi Zhou, K. Schwan, I. Akyildiz","doi":"10.1109/REAL.1992.242677","DOIUrl":"https://doi.org/10.1109/REAL.1992.242677","url":null,"abstract":"Two questions are examined, regarding real-time multiprocessor scheduling for large-scale nonuniform memory access (NUMA) architectures: how are the latency and the quality of scheduling affected by different degrees of completeness in the information shared among multiple potentially concurrent schedules, and how can scheduling information be represented so that it is efficiently and concurrently accessible? The authors present a real-time scheduling algorithm for multiprocessors that is scalable in the number of tasks performing scheduling and in the maximum amount of computation time consumed by those tasks. They also develop a flexible representation for shared information within the distributed scheduler that is easily varied regarding its degree of information completeness. It is then shown that the sharing of incomplete (vs. complete) information can lead to increased performance regarding scheduling latency with few or no losses in scheduling quality. In addition, it is shown that this holds for a variety of parallel machines, ranging from NUMA to distributed memory machines.<<ETX>>","PeriodicalId":158503,"journal":{"name":"[1992] Proceedings Real-Time Systems Symposium","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126742254","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
Transition scheduling in (multiclass real-time database systems 多类实时数据库系统中的迁移调度
[1992] Proceedings Real-Time Systems Symposium Pub Date : 1992-12-02 DOI: 10.1109/REAL.1992.242679
HweeHwa Pang, M. Livny, M. Carey
{"title":"Transition scheduling in (multiclass real-time database systems","authors":"HweeHwa Pang, M. Livny, M. Carey","doi":"10.1109/REAL.1992.242679","DOIUrl":"https://doi.org/10.1109/REAL.1992.242679","url":null,"abstract":"The issue of priority assignment is addressed, in firm multiclass real-time database systems (RTDBSs) where classes are distinguished by their mean sizes. It is shown that the earliest deadline scheduling principle, upon which a number of existing priority assignment policies are based, discriminates significantly against longer transactions. This observation has motivated the development of a novel dynamic priority assignment scheme that improves the chances for long transactions to meet their time constraints, thereby providing a fairer mechanism for use in multiclass RTDBS transaction scheduling.<<ETX>>","PeriodicalId":158503,"journal":{"name":"[1992] Proceedings Real-Time Systems Symposium","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121882850","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}
引用次数: 47
Mode changes in priority preemptively scheduled systems 优先级抢占调度系统模式改变
[1992] Proceedings Real-Time Systems Symposium Pub Date : 1992-12-02 DOI: 10.1109/REAL.1992.242672
K. Tindell, A. Burns, A. Wellings
{"title":"Mode changes in priority preemptively scheduled systems","authors":"K. Tindell, A. Burns, A. Wellings","doi":"10.1109/REAL.1992.242672","DOIUrl":"https://doi.org/10.1109/REAL.1992.242672","url":null,"abstract":"It is noted that in many hard real-time systems, the set of functions that a system is required to provide may change over time. One way of providing this change is to allow currently running hard real-time tasks to be deleted or changed, or new tasks to be added. The authors define this change as a mode change, and seek to guarantee a priori the timing constraints of all tasks across the change from one mode to another. The authors derive a scheduling theory for static priority preemptive scheduling that can be used to make such guarantees. The schedulability test discussed could easily be incorporated into engineering support tools. The authors also discuss some of the approaches that could be taken to extend the analysis to cope with more complex and interesting scheduling problems, and to handle distributed hard real-time systems.<<ETX>>","PeriodicalId":158503,"journal":{"name":"[1992] Proceedings Real-Time Systems Symposium","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124953502","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}
引用次数: 170
Adaptive threshold-based scheduling for real-time and non-real-time traffic 实时和非实时流量的自适应阈值调度
[1992] Proceedings Real-Time Systems Symposium Pub Date : 1992-12-02 DOI: 10.1109/REAL.1992.242670
W. Zhu, S. Chanson
{"title":"Adaptive threshold-based scheduling for real-time and non-real-time traffic","authors":"W. Zhu, S. Chanson","doi":"10.1109/REAL.1992.242670","DOIUrl":"https://doi.org/10.1109/REAL.1992.242670","url":null,"abstract":"A study on scheduling mixed real-time and nonreal-time traffic is presented. The work is motivated by the need to provide satisfactory performance tradeoffs in a dynamic load condition where the arrival rates and proportions of the real-time and nonreal-time packets vary with time. The authors first examine two threshold-based schemes, queue length threshold and minimum early threshold, and propose the corresponding adaptive schemes based on results from approximate analysis and simulation. The idea is to improve performance by adjusting tradeoff points adaptively as the arrival rates change. The authors further discuss the idea of integrating the two thresholds. The new algorithm ADP, is evaluated by simulation under various load conditions and compared with other common scheduling disciplines as well as an optimal offline algorithm. It is concluded that, by setting appropriate threshold functions in accordance with the requirements of applications, one can achieve satisfactory bounded loss ratio for real-time packets and acceptably low average delay for nonreal-time packets in a wide range of workload conditions.<<ETX>>","PeriodicalId":158503,"journal":{"name":"[1992] Proceedings Real-Time Systems Symposium","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125530524","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
Monitoring timing constraints in distributed real-time systems 分布式实时系统的监控时间约束
[1992] Proceedings Real-Time Systems Symposium Pub Date : 1992-12-02 DOI: 10.1109/REAL.1992.242676
S. Raju, R. Rajkumar, F. Jahanian
{"title":"Monitoring timing constraints in distributed real-time systems","authors":"S. Raju, R. Rajkumar, F. Jahanian","doi":"10.1109/REAL.1992.242676","DOIUrl":"https://doi.org/10.1109/REAL.1992.242676","url":null,"abstract":"A run-time environment for monitoring distributed real-time systems is described. In particular, the authors focus on the problem of detecting violations of timing assertions in an environment in which the real-time tasks run on multiple processors, and timing constraints can be either interprocessor or intraprocessor constraints. Constraint violations are detected at the earliest possible time by deriving and checking intermediate constraints. If the violations must be detected as early as possible, then the problem of minimizing the number of messages to be exchanged between the processors becomes intractable. The authors characterize a subclass of timing constraints that occur commonly in distributed real-time systems and whose message requirements can be minimized. They also take into account the drift among the various processor clocks when detecting a violation of a timing assertion. Finally, an implementation of a distributed run-time monitor is described.<<ETX>>","PeriodicalId":158503,"journal":{"name":"[1992] Proceedings Real-Time Systems Symposium","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126136020","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}
引用次数: 62
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems 分布式实时系统中具有优先级和期限约束的周期任务模块分配
[1992] Proceedings Real-Time Systems Symposium Pub Date : 1992-12-02 DOI: 10.1109/REAL.1992.242668
J. Hou, K. Shin
{"title":"Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems","authors":"J. Hou, K. Shin","doi":"10.1109/REAL.1992.242668","DOIUrl":"https://doi.org/10.1109/REAL.1992.242668","url":null,"abstract":"The authors address the problem of allocating (assigning and scheduling) periodic task modules to processing nodes (PNs) in distributed real-time systems subject to task precedence and timing constraints. Using the branch-and-bound technique, a module allocation algorithm (MAA) is proposed to find an optimal allocation that maximizes the probability of meeting task deadlines. To incorporate both timing and logical correctness into module allocation, the probability of meeting task deadlines is used as the objective function. The MAA is then applied to find an optimal allocation of task modules in a distributed system. The timing aspects embedded in the objective function drive the MAA not only to assign task modules to PNs, but also to use a module scheduling algorithm for scheduling all modules assigned to each PN so that all tasks may be completed in time. Several numerical examples are presented to demonstrate the effectiveness and practicality of the proposed algorithms.<<ETX>>","PeriodicalId":158503,"journal":{"name":"[1992] Proceedings Real-Time Systems Symposium","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126297453","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}
引用次数: 149
下一页 尾页
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学术官方微信
小红书