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

Proceedings. Real-Time Systems Symposium最新文献

筛选
英文 中文
Optimal resource control in periodic real-time environments 周期性实时环境下的最优资源控制
Proceedings. Real-Time Systems Symposium Pub Date : 1988-12-06 DOI: 10.1109/REAL.1988.51098
K. Shin, C. M. Krishna, Yann-Hang Lee
{"title":"Optimal resource control in periodic real-time environments","authors":"K. Shin, C. M. Krishna, Yann-Hang Lee","doi":"10.1109/REAL.1988.51098","DOIUrl":"https://doi.org/10.1109/REAL.1988.51098","url":null,"abstract":"Three factors determine the optimum configuration of a multiprocessor at any epoch: the workload, the reward structure, and the state of the computer system. An algorithm is presented for the optimal (more realistically, quasi-optimal) configuration of such systems used in real-time applications with periodic reward rates and workloads. The algorithm is based on Markov decision theory. It is suggested that a change in the workload or the reward structure should be as powerful a motivation for reconfiguration as component failure. Such changes occur naturally over the course of operation: an example of an online transaction processing system with a workload and reward structure that has a period of a day is given.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"8 17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129584101","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}
引用次数: 4
Estimating task response time with contentions for real-time distributed systems 实时分布式系统中带争用的任务响应时间估计
Proceedings. Real-Time Systems Symposium Pub Date : 1988-12-06 DOI: 10.1109/REAL.1988.51122
W. Chu, Chi-Man Sit
{"title":"Estimating task response time with contentions for real-time distributed systems","authors":"W. Chu, Chi-Man Sit","doi":"10.1109/REAL.1988.51122","DOIUrl":"https://doi.org/10.1109/REAL.1988.51122","url":null,"abstract":"Response time is affected by interprocessor communications, precedence relationships among the modules, module assignments, and processor scheduling policies. Furthermore, due to sharing of resources and data among the processors, contention delays are incurred. A task response time model that considers all these factors is proposed. A Petri net is used to represent resource contention, and the task control flow graph represents module precedence and logical relationships. A queuing network with resource contention is used to estimate the response time of each module. Module response time consists of delays at the processors and resource queues and is estimated by approximating the extended queuing network as independent finite capacity queuing systems. The module response time is mapped onto a control flow graph, and task response time is obtained by aggregating the module response times in accordance with their precedence relationship in the control flow graph. The task response time derived from the analytical model compares well with that from the simulation.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131372051","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}
引用次数: 12
Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithm 利用未使用的周期时间为非周期服务使用扩展优先级交换算法
Proceedings. Real-Time Systems Symposium Pub Date : 1988-12-06 DOI: 10.1109/REAL.1988.51120
B. Sprunt, J. Lehoczky, L. Sha
{"title":"Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithm","authors":"B. Sprunt, J. Lehoczky, L. Sha","doi":"10.1109/REAL.1988.51120","DOIUrl":"https://doi.org/10.1109/REAL.1988.51120","url":null,"abstract":"Real-time scheduling algorithms that provide responsive aperiodic service in the presence of hard real-time periodic tasks require the creation of a high-priority periodic server task for servicing aperiodic requests. The authors describe the extended priority exchange algorithm, which can provide better aperiodic response than previous aperiodic service algorithms, particularly for cases where the worst-case periodic load is high and little or no utilization is left for a server task. The extended-priority-exchange (EPE) algorithm attains better aperiodic responsiveness by exploiting unused time allocated to periodic tasks for aperiodic service. The average aperiodic response times for the EPE algorithm and four other aperiodic service algorithms (background, polling, deferrable server, and priority exchange) are compared for a range of periodic and aperiodic loads. Simulation results show that for a difference between the average and worst-case periodic load of only 12.5%, the EPE algorithm provides significantly better response times for aperiodic tasks.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"19 2-3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124813647","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}
引用次数: 161
Missile guidance processor software development-a case study 导弹制导处理器软件开发-一个案例研究
Proceedings. Real-Time Systems Symposium Pub Date : 1988-12-06 DOI: 10.1109/REAL.1988.51101
R. Bond, S. Bemrich, J. Connelty, G. Pendergrass, J. Hulsey
{"title":"Missile guidance processor software development-a case study","authors":"R. Bond, S. Bemrich, J. Connelty, G. Pendergrass, J. Hulsey","doi":"10.1109/REAL.1988.51101","DOIUrl":"https://doi.org/10.1109/REAL.1988.51101","url":null,"abstract":"A case study of a near-complete implementation of a real-time software system is presented. The software implements a missile guidance processor control system. The languages of implementation are C and assembler, targeted to an MC68020 central processing unit with an MC68881 floating-point coprocessor and an HD63450 direct memory access controller. Modern software engineering practices were used, including information hiding, separation of concerns, modularity, adaptability, and incremental development. Performance considerations required optimizing the use of hardware systems and minimizing run-time support.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121878190","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
Advanced real-time scheduling using the IEEE 802.5 token ring 使用IEEE 802.5令牌环的高级实时调度
Proceedings. Real-Time Systems Symposium Pub Date : 1988-12-06 DOI: 10.1109/REAL.1988.51099
J. Strosnider, T. E. Marchok, J. Lehoczky
{"title":"Advanced real-time scheduling using the IEEE 802.5 token ring","authors":"J. Strosnider, T. E. Marchok, J. Lehoczky","doi":"10.1109/REAL.1988.51099","DOIUrl":"https://doi.org/10.1109/REAL.1988.51099","url":null,"abstract":"An approach for scheduling the IEEE 802.5 token ring for hard real-time applications is presented that not only guarantees deadlines for synchronous class messages, but also greatly reduces asynchronous class response times. Highly responsive guaranteed service is introduced for alert class asynchronous messages. Conventional use of the IEEE 802.5 token ring provides synchronous communication services using time-domain multiplexing (TDM) while relegating asynchronous class message services to background status. An algorithmic-based scheduling approach is presented that supports a priori schedulability determination for arbitrary synchronous message sets without the costly time-line development, testing, and tuning associated with TDM techniques. This capability allows the IEEE 802.5 to support dynamic, adaptive and reconfigurable run-time environments where the inflexibility of TDM would be prohibitive. Advanced real-time scheduling applied to the IEEE 802.5 token ring greatly enhances the responsiveness of asynchronous class messages while still maintaining guaranteed service for the synchronous class.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130198078","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}
引用次数: 104
Algorithms for scheduling periodic jobs to minimize average error 最小化平均误差的周期性作业调度算法
Proceedings. Real-Time Systems Symposium Pub Date : 1988-12-06 DOI: 10.1109/REAL.1988.51110
Jen-Yao Chung, J. Liu
{"title":"Algorithms for scheduling periodic jobs to minimize average error","authors":"Jen-Yao Chung, J. Liu","doi":"10.1109/REAL.1988.51110","DOIUrl":"https://doi.org/10.1109/REAL.1988.51110","url":null,"abstract":"Several preemptive, priority-driven algorithms for scheduling periodic jobs on systems that support imprecise computations are described and evaluated. The algorithms are designed to keep the average error in the results produced over consecutive periods small. The approach taken here is to consider each task as consisting of two parts: a mandatory part that must be completed in order for the task to produce an acceptable result, and an optional part that refines the result produced by the mandatory part to reduce the error in the result. The mandatory parts of all tasks have hard deadlines; the rate-monotone algorithm is used to schedule them to meet all deadlines. The optional parts have soft deadlines; different algorithms are used to schedule the optional parts to minimize the average error. The performance of these algorithms is evaluated in terms of the average error over all jobs as a function of their total utilization factor.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129790875","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}
引用次数: 42
Allocation of real-time computations under fault tolerance constraints 容错约束下的实时计算分配
Proceedings. Real-Time Systems Symposium Pub Date : 1988-12-06 DOI: 10.1109/REAL.1988.51112
S. Levi, D. Mossé, A. Agrawala
{"title":"Allocation of real-time computations under fault tolerance constraints","authors":"S. Levi, D. Mossé, A. Agrawala","doi":"10.1109/REAL.1988.51112","DOIUrl":"https://doi.org/10.1109/REAL.1988.51112","url":null,"abstract":"An allocation scheme is proposed that accomplishes the hard real-time goal of guaranteeing a deadline satisfaction in case the job is accepted. In addition, the scheme supports fault-tolerance objectives in both damage containment and resiliency requirements. It does this in cooperation with a schedulability verification mechanism and with an object architecture in which for each object there exists a calendar that maintains the time of its execution. The scheme can be used for reallocation while increasing the resiliency.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133544327","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}
引用次数: 12
Evaluation of the probability of dynamic failure and processor utilization for real-time systems 实时系统动态故障概率和处理器利用率的评估
Proceedings. Real-Time Systems Symposium Pub Date : 1988-12-06 DOI: 10.1109/REAL.1988.51117
Michael H. Woodbury, K. Shin
{"title":"Evaluation of the probability of dynamic failure and processor utilization for real-time systems","authors":"Michael H. Woodbury, K. Shin","doi":"10.1109/REAL.1988.51117","DOIUrl":"https://doi.org/10.1109/REAL.1988.51117","url":null,"abstract":"It is shown how to determine closed-form expressions for task scheduling delay and active task time distributions for any real-time system application, given a scheduling policy and task execution time distributions. The active task time denotes the total time a task is executing or waiting to be executed, including scheduling delays and resource contention delays. The distributions are used to determine the probability of dynamic failure and processor utilization, where the probability of dynamic failure is the probability that any task will not complete before its deadline. The opposing effects of decreasing the probability of dynamic failure and increasing utilization are also addressed. The analysis first addresses workloads where all tasks are periodic, i.e., they are repetitively triggered at constant frequencies. It is then extended to include the arrival of asynchronously triggered tasks. The effects of asynchronous tasks on the probability of dynamic failure and utilization are addressed.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124038034","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}
引用次数: 11
What's 'real' about real-time systems? 实时系统的“真实”是什么?
Proceedings. Real-Time Systems Symposium Pub Date : 1988-05-01 DOI: 10.1109/REAL.1988.51103
M. Joseph, A. Goswami
{"title":"What's 'real' about real-time systems?","authors":"M. Joseph, A. Goswami","doi":"10.1109/REAL.1988.51103","DOIUrl":"https://doi.org/10.1109/REAL.1988.51103","url":null,"abstract":"A real-time system is a concurrent computing system whose computations and actions must satisfy time constraints. Guaranteeing that such a system will meet its constraints can be viewed either in terms of an extended model of program correctness or as a problem of scheduling, e.g. establishing a feasible schedule. However, a crucial distinction between real-time and other concurrent programs is not merely that of time, but that the former must often execute on systems with limited resources. The authors give a short account of a limited resource semantics of program execution. The model can serve both as the basis for a formal specification system for real-time programs and to characterize real-time scheduling problems.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117216206","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
首页 上一页
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学术官方微信