Proceedings Real-Time Systems Symposium最新文献

Real-time queueing network theory 实时排队网络理论

Proceedings Real-Time Systems Symposium Pub Date : 1997-12-03 DOI: 10.1109/REAL.1997.641269

J. Lehoczky

引用次数: 84

Jitter concerns in periodic task systems 周期性任务系统中的抖动问题

Proceedings Real-Time Systems Symposium Pub Date : 1997-12-03 DOI: 10.1109/REAL.1997.641270

Sanjoy Baruah, Deji Chen, A. Mok

引用次数: 33

A cache-aware scheduling algorithm for embedded systems 嵌入式系统的缓存感知调度算法

Proceedings Real-Time Systems Symposium Pub Date : 1997-12-03 DOI: 10.1109/REAL.1997.641282

G. Luculli, M. Natale

引用次数: 5

A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms 实时固定优先级调度算法的一个更好的多项式时间可调度性测试

Proceedings Real-Time Systems Symposium Pub Date : 1997-12-03 DOI: 10.1109/REAL.1997.641267

C. Han, Hung-Ying Tyan

{"title":"A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms","authors":"C. Han, Hung-Ying Tyan","doi":"10.1109/REAL.1997.641267","DOIUrl":"https://doi.org/10.1109/REAL.1997.641267","url":null,"abstract":"The problem of scheduling real-time periodic task has been studied extensively since its first introduction by C.L. Liu and J.W. Layland in their classic paper (1973). Due to several merits of the fixed-priority scheduling scheme, a lot of research work has focused on the analysis of fixed-priority scheduling algorithms. For the case that the deadlines of the executions of all the tasks coincide with the ends of their corresponding periods. Liu and Layland derived a worst-case utilization bound for a task set to be schedulable by the rate-monotonic (RM) algorithm. A. Burchard et al. (1995) presented another schedulability condition for RM, which has a higher utilization bound under a certain task condition. Although their closed-form utilization bounds provide a convenient way for testing the schedulability of a task set under the RM algorithm, the schedulability test using their bounds is too pessimistic since a lot of task sets with total utilizations larger than their bounds (and less than or equal to 1) are still schedulable by RM. In this paper, we propose a polynomial-time schedulability test and prove that it is better than Liu and Layland's and Burchard's utilization bounds in the sense that as long as the total utilization of a task set is less than or equal to their bounds, our schedulability test will always answer positively for the schedulability of the task set under RM and even if a feasible task set has a total utilization larger than their bounds, our schedulability test will still answer positively with a high probability. We also show how to generalize our polynomial-time schedulability test to handle general task sets scheduled by arbitrary fixed-priority scheduling algorithms.","PeriodicalId":231201,"journal":{"name":"Proceedings Real-Time Systems Symposium","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134313357","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}

引用次数: 145

Proceedings Real-Time Systems Symposium Pub Date : 1997-12-03 DOI: 10.1109/REAL.1997.641277

Shao-Juen Ho, Tei-Wei Kuo, A. Mok

引用次数: 63

Static priority scheduling for ATM networks ATM网络的静态优先级调度

Proceedings Real-Time Systems Symposium Pub Date : 1997-12-03 DOI: 10.1109/REAL.1997.641288

Chengzhi Li, R. Bettati, Wei Zhao

引用次数: 48

On-the-fly symbolic model checking for real-time systems 实时系统的动态符号模型检查

Proceedings Real-Time Systems Symposium Pub Date : 1997-12-03 DOI: 10.1109/REAL.1997.641266

A. Bouajjani, S. Tripakis, S. Yovine

引用次数: 100

A resource allocation model for QoS management QoS管理的资源分配模型

Proceedings Real-Time Systems Symposium Pub Date : 1997-12-03 DOI: 10.1109/REAL.1997.641291

R. Rajkumar, Chen Lee, J. Lehoczky, D. Siewiorek

{"title":"A resource allocation model for QoS management","authors":"R. Rajkumar, Chen Lee, J. Lehoczky, D. Siewiorek","doi":"10.1109/REAL.1997.641291","DOIUrl":"https://doi.org/10.1109/REAL.1997.641291","url":null,"abstract":"Quality of service (QoS) has been receiving wide attention in many research communities including networking, multimedia systems, real-time systems and distributed systems. In large distributed systems such as those used in defense systems, on-demand service and inter-networked systems, applications contending for system resources must satisfy timing, reliability and security constraints as well as application-specific quality requirements. Allocating sufficient resources to different applications in order to satisfy various requirements is a fundamental problem in these situations. A basic yet flexible model for performance-driven resource allocations can therefore be useful in making appropriate tradeoffs. We present an analytical model for QoS management in systems which must satisfy application needs along multiple dimensions such as timeliness, reliable delivery schemes, cryptographic security and data quality. We refer to this model as Q-RAM (QoS-based Resource Allocation Model). The model assumes a system with multiple concurrent applications, each of which can operate at different levels of quality based on the system resources available to it. The goal of the model is to be able to allocate resources to the various applications such that the overall system utility is maximized under the constraint that each application can meet its minimum needs. We identify resource profiles of applications which allow such decisions to be made efficiently and in real-time. We also identify application utility functions along different dimensions which are composable to form unique application requirement profiles. We use a video-conferencing system to illustrate the model.","PeriodicalId":231201,"journal":{"name":"Proceedings Real-Time Systems Symposium","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122173123","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}

引用次数: 524

Exploiting skips in periodic tasks for enhancing aperiodic responsiveness 利用周期性任务中的跳过来增强非周期响应性

Proceedings Real-Time Systems Symposium Pub Date : 1997-12-03 DOI: 10.1109/REAL.1997.641294

M. Caccamo, G. Buttazzo

引用次数: 57

Optimal smoothness results and approximation techniques for real-time VBR video traffic smoothing 实时VBR视频流量平滑的最佳平滑结果和近似技术

Proceedings Real-Time Systems Symposium Pub Date : 1997-12-03 DOI: 10.1109/REAL.1997.641287

Junbiao Zhang, J. Hui

引用次数: 4