Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054)最新文献_第3页

Priority inheritance and ceilings for distributed mutual exclusion 优先级继承和分布式互斥的上限

Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054) Pub Date : 1999-12-01 DOI: 10.1109/REAL.1999.818861

F. Müller

{"title":"Priority inheritance and ceilings for distributed mutual exclusion","authors":"F. Müller","doi":"10.1109/REAL.1999.818861","DOIUrl":"https://doi.org/10.1109/REAL.1999.818861","url":null,"abstract":"The contributions of this paper are threefold. First, a solution to the problem of prioritized mutual exclusion in a distributed system is proved correct. This protocol is based on fewer requirements than prioritized extensions of other protocols and outperforms other protocols with an average complexity of /spl theta/(log n) and a worst-case complexity of O(n) messages for n nodes. Second, the concept of relative fairness is introduced which quantifies the relation between parallel events in terms of their ordering in the absence of synchronized clocks. This concept is applied to the protocol in order to determine a requirement to guarantee a certain order between events when message delays are bounded. Third, the protocol is extended to prevent priority inversion by incorporating the priority inheritance and the priority ceiling protocols. The extensions are shown to integrate well with the original protocol. They impose the same message overhead as mentioned before for each dynamically raised priority due to resource contention while early priority boosting, such as for the priority ceiling emulation protocol, requires no additional overhead at all.","PeriodicalId":160347,"journal":{"name":"Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115153032","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}

引用次数: 32

Pfair scheduling of fixed and migrating periodic tasks on multiple resources 对多资源上的固定任务和周期性任务进行合理调度

Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054) Pub Date : 1999-12-01 DOI: 10.1109/REAL.1999.818857

Mark Moir, Srikanth Ramamurthy

引用次数: 93

Analysis of the impacts of overestimation sources on the accuracy of worst case timing analysis 超估计源对最坏情况时序分析精度的影响分析

Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054) Pub Date : 1999-12-01 DOI: 10.1109/REAL.1999.818825

Sung-Kwan Kim, S. Min, Rhan Ha

{"title":"Analysis of the impacts of overestimation sources on the accuracy of worst case timing analysis","authors":"Sung-Kwan Kim, S. Min, Rhan Ha","doi":"10.1109/REAL.1999.818825","DOIUrl":"https://doi.org/10.1109/REAL.1999.818825","url":null,"abstract":"To predict the worst case execution time (WCET) of real-time tasks, we should consider various factors (e.g., caching, pipelining, and infeasible paths) that affect the accuracy of the prediction. However some of them are inherently difficult to analyze statically, and thus may give rise to significant overestimation in WCET prediction. Therefore, for more accurate WCET prediction, we need to identify, such overestimation sources and analyze how much each of them can make overestimation. Then, such analysis results can be used to refine existing timing analysis techniques. In this paper we do not propose any new timing analysis techniques, but present quantitative analysis results on the impacts of overestimation sources on the accuracy of the worst case timing analysis. For this purpose, we use variance analysis based on a simulation-based methodology to make our analysis independent of any existing techniques. The results show that the dominant factor is pipelining analysis when the cache miss penalty is small and instruction caching analysis when the cache miss penalty is larger than 10 cycles. The results also show that although the impact of data caching analysis is small compared with that of pipelining or instruction caching analysis, if we ignore its effect in the WCET estimation, the WCET can be overestimated up to 275% even when the effects of the other factors are completely analyzed. Finally, the results show that the effects of infeasible paths are largely orthogonal to other analysis features and depend on program characteristics. Also, as for data caching, if infeasible paths are ignored in the WCET estimation, the accuracy of the WCET estimation is degraded significantly (up to 564%).","PeriodicalId":160347,"journal":{"name":"Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122984559","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

Enabling deadline scheduling for Java real-time computing 启用Java实时计算的截止日期调度

Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054) Pub Date : 1999-12-01 DOI: 10.1109/REAL.1999.818837

C. Lizzi

引用次数: 5

New results on fixed priority aperiodic servers 在固定优先级非周期服务器上的新结果

Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054) Pub Date : 1999-12-01 DOI: 10.1109/REAL.1999.818829

G. Bernat, A. Burns

引用次数: 90

A framework for provisioning of temporal QoS in core-based multicast routing 在基于核心的多播路由中提供暂时QoS的框架

Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054) Pub Date : 1999-12-01 DOI: 10.1109/REAL.1999.818840

Hung-Ying Tyan, J. Hou, Bin Wang

引用次数: 6

Optimal reward-based scheduling of periodic real-time tasks 基于奖励的周期性实时任务优化调度

Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054) Pub Date : 1999-12-01 DOI: 10.1109/REAL.1999.818830

Hakan Aydin, R. Melhem, D. Mossé, Pedro Mejía-Alvarez

引用次数: 220

FARACost: an adaptation cost model aware of pending constraints FARACost:意识到未决约束的适应成本模型

Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054) Pub Date : 1999-12-01 DOI: 10.1109/REAL.1999.818848

D. Rosu, K. Schwan

引用次数: 17

High-level modeling and analysis of TCAS TCAS的高级建模与分析

Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054) Pub Date : 1999-12-01 DOI: 10.1109/REAL.1999.818833

Carolos Livadas, J. Lygeros, N. Lynch

{"title":"High-level modeling and analysis of TCAS","authors":"Carolos Livadas, J. Lygeros, N. Lynch","doi":"10.1109/REAL.1999.818833","DOIUrl":"https://doi.org/10.1109/REAL.1999.818833","url":null,"abstract":"In this paper we demonstrate a high-level approach to modeling and analyzing complex safety-critical systems through a case study in the area of air traffic management. In particular, we focus our attention on the Traffic Alert and Collision Avoidance System (TCAS); an on-board conflict detection and resolution system which alerts pilots to the presence of nearby aircraft that pose a mid-air collision threat and issues conflict resolution advisories. Due to the complexity of the TCAS software and the hybrid nature of the closed-loop system, the traditional testing techniques through simulation do not constitute a viable verification approach. To aid people in analyzing and designing such systems, we advocate defining high-level mathematical system models that capture the behavior not only of the software, but also of the airplanes, sensors, and pilots-that is, high-level hybrid system models. In particular we show how the core components of this complex system can be captured by relatively simple Hybrid I/O Automata (HIOA) which are amenable to formal analysis. We then outline a methodology for establishing conditions under which the conflict resolution advisories issued by TCAS guarantee sufficient separation in altitude for aircraft involved in mid-air collision threats. Although our results are intended only as illustrations of high-level modeling and analysis techniques, the TCAS system models provide a foundation for study of a wide range of properties of the system's behavior.","PeriodicalId":160347,"journal":{"name":"Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132958191","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}

引用次数: 72

Efficient delay computation methods for an ATM network with real-time video traffic 具有实时视频流量的ATM网络的有效延迟计算方法

Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054) Pub Date : 1999-12-01 DOI: 10.1109/REAL.1999.818842

Shibin Song, J. Ng, B. Tang

{"title":"Efficient delay computation methods for an ATM network with real-time video traffic","authors":"Shibin Song, J. Ng, B. Tang","doi":"10.1109/REAL.1999.818842","DOIUrl":"https://doi.org/10.1109/REAL.1999.818842","url":null,"abstract":"Consider a real time communication application running on top of an ATM network; we require the connection to provide a transmission guarantee for the real time service. Such transmission guarantee can only be possible if there exists an absolute and deterministic worst case delay bound on all the ATM cells within the real time connection. We present our approach in finding this worst case cell delay within an ATM switch. In terms of computation complexity, we find out that our proposed method is no harder than any other existing methods in finding such worse case delay. Furthermore, while other researchers tackle different schedulers with different approaches, our method is general enough and is applicable to schedulers that adopt the FIFO, Static Priority (SP), Earliest Deadline First (EDF) and Generalized Processor Sharing (GPS) scheduling policies. In addition, in our proposed \"Fixed Points\" method, we trade off accuracy with computation complexity for performance. As a result, our improved method is shown to be superior to all existing methods in terms of computation complexity. Through our simulation experiments based on real time MPEG video streams, the loss in accuracy for estimating the worst case cell delay is shown to be negligible for the connection admission control for an ATM network.","PeriodicalId":160347,"journal":{"name":"Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123603222","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}

引用次数: 3