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

Proceedings. Real-Time Systems Symposium最新文献

筛选
英文 中文
New approaches for the reconfiguration of two-dimensional VLSI arrays using time-redundancy 利用时间冗余重构二维VLSI阵列的新方法
Proceedings. Real-Time Systems Symposium Pub Date : 1988-12-06 DOI: 10.1109/REAL.1988.51126
S. Yurttas, F. Lombardi
{"title":"New approaches for the reconfiguration of two-dimensional VLSI arrays using time-redundancy","authors":"S. Yurttas, F. Lombardi","doi":"10.1109/REAL.1988.51126","DOIUrl":"https://doi.org/10.1109/REAL.1988.51126","url":null,"abstract":"Two novel approaches are presented in which no spare cells are used. They are based on the full processing utilization of fault-free cells by exploiting the single-product-step of a systolic array. This results in a reconfigured array with no degradation of computational speed. The basic principles of the time-redundancy technique are discussed, with particular emphasis on the selection and allocation processes for finding the reconfiguration-solution in real-time. The first approach is based on a distributed execution of the reconfiguration process. The immediate advantages of this approach are its simplicity of implementation and the fast execution time. The second approach is based on a more complex reconfiguration procedure that accounts for an iterative execution of the first approach. Appropriate conditions for its correct execution are presented.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"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":"114775550","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
On-line scheduling of real-time tasks 实时任务的在线调度
Proceedings. Real-Time Systems Symposium Pub Date : 1988-12-06 DOI: 10.1109/REAL.1988.51119
K. Hong, J. Leung
{"title":"On-line scheduling of real-time tasks","authors":"K. Hong, J. Leung","doi":"10.1109/REAL.1988.51119","DOIUrl":"https://doi.org/10.1109/REAL.1988.51119","url":null,"abstract":"The problem of online scheduling of a set of n independent, real-time tasks on m>or=1 identical processors is addressed. An online scheduler is said to be optimal if it performs as well as the best offline scheduler. It is shown that no optimal online scheduler can exist if the tasks have more than one distinct deadline. An optimal online scheduler for tasks with one common deadline is given. An optimal online scheduler is also given for environments in which processors can go down unexpectedly.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"28 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":"124266355","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}
引用次数: 178
A comparison of four adaptation algorithms for increasing the reliability of real-time software 提高实时软件可靠性的四种自适应算法的比较
Proceedings. Real-Time Systems Symposium Pub Date : 1988-12-06 DOI: 10.1109/REAL.1988.51118
T. Bihari, K. Schwan
{"title":"A comparison of four adaptation algorithms for increasing the reliability of real-time software","authors":"T. Bihari, K. Schwan","doi":"10.1109/REAL.1988.51118","DOIUrl":"https://doi.org/10.1109/REAL.1988.51118","url":null,"abstract":"In a large, parallel, real-time computer system, it is frequently most cost-effective to use different software reliability techniques (e.g., retry, replication, and resource-allocation algorithms) at different levels of granularity or within different subsystems, dependent on the reliability requirements and fault models associated with each subsystem. The authors describe the results of applying four reliability algorithms, via RESAS (REal-time Software Adaptation System), to a sample real-time program executing on a multiprocessor.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"25 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":"133788542","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}
引用次数: 19
Analysis of speedup and communication/computation ratio in multiprocessor systems 多处理器系统的加速和通信/计算比分析
Proceedings. Real-Time Systems Symposium Pub Date : 1988-12-06 DOI: 10.1109/REAL.1988.51123
X. Li, M. Malek
{"title":"Analysis of speedup and communication/computation ratio in multiprocessor systems","authors":"X. Li, M. Malek","doi":"10.1109/REAL.1988.51123","DOIUrl":"https://doi.org/10.1109/REAL.1988.51123","url":null,"abstract":"The quantitative relationship between speedup and communication is analyzed in terms of the ratio of the communication time to the computation time. An extension to Amdahl's law is proposed to include communication and to estimate the lower and upper bounds on speedup in multiprocessor systems. A method for estimating a response time in a multiprocessor system that incorporates the impact of communication delay is also proposed.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"40 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":"133363577","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
Execution of a high level real-time language 一种高级实时语言的执行
Proceedings. Real-Time Systems Symposium Pub Date : 1988-12-06 DOI: 10.1109/REAL.1988.51102
Luqi, V. Berzins
{"title":"Execution of a high level real-time language","authors":"Luqi, V. Berzins","doi":"10.1109/REAL.1988.51102","DOIUrl":"https://doi.org/10.1109/REAL.1988.51102","url":null,"abstract":"Prototype system description language is a high-level real-time language with special features for hard real-time system specification and design. It can be used to firm up requirements through execution of its software prototypes. The language design is based on a real-time model merging data and control flow, and its implementation is beyond conventional compiler technology because of the need to meet real-time constraints. A special scheme used to meet the hard real-time constraints and the guidelines used to implement such a language in the target language Ada are described and illustrated. The required software tools for automated translation and scheduling are also discussed. These tools have been designed, and a prototype version has been partially implemented.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"100 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":"127111815","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
The integration of deadline and criticalness in hard real-time scheduling 硬实时调度中截止日期和关键时刻的集成
Proceedings. Real-Time Systems Symposium Pub Date : 1988-12-06 DOI: 10.1109/REAL.1988.51111
S. Biyabani, J. Stankovic, K. Ramamritham
{"title":"The integration of deadline and criticalness in hard real-time scheduling","authors":"S. Biyabani, J. Stankovic, K. Ramamritham","doi":"10.1109/REAL.1988.51111","DOIUrl":"https://doi.org/10.1109/REAL.1988.51111","url":null,"abstract":"Two task-scheduling algorithms for distributed hard real-time computer systems are presented. Both algorithms are based on a heuristic approach and explicitly account for both the deadlines and criticality of tasks when making scheduling decisions. In analyzing the algorithms, a performance metric called the weighted guarantee ratio is defined. It reflects both the percentage of tasks that make their deadlines and their relative worth to the system. The performance is analyzed by simulating the behavior of the algorithms as well as that of several other pertinent baseline algorithms under a wide range of system conditions including a nonhomogeneous task arrival rate. The results show that the algorithms outperform all the baseline algorithms except for the ideal but impractical centralized baseline and in many cases perform close to the ideal.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"29 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":"121333458","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
Guaranteeing deadlines in MAFT 保证MAFT的最后期限
Proceedings. Real-Time Systems Symposium Pub Date : 1988-12-06 DOI: 10.1109/REAL.1988.51109
M. C. McElvany
{"title":"Guaranteeing deadlines in MAFT","authors":"M. C. McElvany","doi":"10.1109/REAL.1988.51109","DOIUrl":"https://doi.org/10.1109/REAL.1988.51109","url":null,"abstract":"The author discusses scheduling in the multicomputer architecture for fault-tolerance (MAFT), a distributed system designed to provide extremely reliable computation in real-time control systems. Scheduling in MAFT is based on a fault-tolerant variation of a priority-list schedule. The threading delay associated with agreement on task completions can cause schedules to experience Richards' anomalies, in which legitimate run-time behavior can cause tasks to miss deadlines. The author develops theory to stabilize the fault-tolerant priority list. She gives an algorithm that stabilizes a restricted class of task workloads and discusses extensions of her results to other workloads.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"207 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":"126597599","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
Semantics of a real-time language 实时语言的语义
Proceedings. Real-Time Systems Symposium Pub Date : 1988-12-06 DOI: 10.1109/REAL.1988.51106
V. Berzins, Luqi
{"title":"Semantics of a real-time language","authors":"V. Berzins, Luqi","doi":"10.1109/REAL.1988.51106","DOIUrl":"https://doi.org/10.1109/REAL.1988.51106","url":null,"abstract":"The authors describe the semantics of the real-time language PSDL, which was designed for prototyping real-time systems. They focus on the aspects of the language relating to hard real-time constraints, scheduling, and functional behavior. They present the aspects of PSDL that simplify the description of real-time constraints and clarify the relationships between periodic and data-driven operators and the interactions between timing and control constraints in a language that combines these features.<<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":"129585084","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
Minimizing mean flow time with release time and deadline constraints 最小化平均流程时间与发布时间和截止日期的限制
Proceedings. Real-Time Systems Symposium Pub Date : 1988-12-06 DOI: 10.1109/REAL.1988.51097
J. Du, J. Leung
{"title":"Minimizing mean flow time with release time and deadline constraints","authors":"J. Du, J. Leung","doi":"10.1109/REAL.1988.51097","DOIUrl":"https://doi.org/10.1109/REAL.1988.51097","url":null,"abstract":"The problem of preemptively scheduling a task system consisting of a set of n independent tasks on one processor so as to minimize the mean flow time is considered. The goal is to find a preemptive schedule such that the mean flow time is minimized subject to the constraint that task T/sub i/ is executed within the interval between its release time and its deadline. Such a schedule, if it exists, is called an optimal schedule. It is shown that the problem of finding an optimal schedule is NP-hard. A greedy algorithm is given to find an optimal schedule for a large class of task systems.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"30 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134259894","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}
引用次数: 35
Process dependent static cache partitioning for real-time systems 用于实时系统的与进程相关的静态缓存分区
Proceedings. Real-Time Systems Symposium Pub Date : 1988-12-06 DOI: 10.1109/REAL.1988.51114
D. Kirk
{"title":"Process dependent static cache partitioning for real-time systems","authors":"D. Kirk","doi":"10.1109/REAL.1988.51114","DOIUrl":"https://doi.org/10.1109/REAL.1988.51114","url":null,"abstract":"The author investigates the use of a priori knowledge of program behavior to partition an instruction cache of size C into a static partition of size S and an LRU partition of size C-S. The value of S is task-dependent and is nonzero for most programs running on the system. Example programs are presented, and their behavior in various size caches is discussed. Cache partitions are generated and evaluated to determine the increase in cache performance and predictability. A high-level hardware design is presented that provides the desired partitioning scheme.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"175 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":"114063064","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}
引用次数: 35
下一页 尾页
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学术官方微信