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

2016 28th Euromicro Conference on Real-Time Systems (ECRTS)最新文献

筛选
英文 中文
Achieving Appropriate Test Coverage for Reliable Measurement-Based Timing Analysis 为可靠的基于测量的时序分析实现适当的测试覆盖率
2016 28th Euromicro Conference on Real-Time Systems (ECRTS) Pub Date : 2016-07-01 DOI: 10.1109/ECRTS.2016.21
S. Law, I. Bate
{"title":"Achieving Appropriate Test Coverage for Reliable Measurement-Based Timing Analysis","authors":"S. Law, I. Bate","doi":"10.1109/ECRTS.2016.21","DOIUrl":"https://doi.org/10.1109/ECRTS.2016.21","url":null,"abstract":"Establishing Worst Case Execution Times (WCET) using Measurement-Based Timing Analysis (MBTA) is only effective if we have reasonable confidence that we have fed the worst case execution trace into the analysis. Therefore for certification, the quality of these traces is of paramount importance. This paper aims to investigate how search algorithms can be used to automatically, and reliably, generate test cases so that appropriate execution traces are available to support MBTA. The work carried out in this paper uses a standard search algorithm and created a number of fitness functions to target the generation of 'good data'. The results are then input into a commercial measurement-based WCET analysis tool. The new fitness functions focus on achieving a combination of full branch coverage and a high number of loop counts, or partial path coverage, however are shown to achieve reliable approximations of the WCET particularly when combined with an MBTA tool. The code items used for the analysis included off the shelf benchmarks, as well as industrial safety-critical aircraft engine control software.","PeriodicalId":178974,"journal":{"name":"2016 28th Euromicro Conference on Real-Time Systems (ECRTS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125535210","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}
引用次数: 52
Cache-Persistence-Aware Response-Time Analysis for Fixed-Priority Preemptive Systems 基于缓存持久性的固定优先级抢占系统响应时间分析
2016 28th Euromicro Conference on Real-Time Systems (ECRTS) Pub Date : 2016-04-11 DOI: 10.1109/ECRTS.2016.25
Syed Aftab Rashid, Geoffrey Nelissen, D. Hardy, B. Akesson, I. Puaut, E. Tovar
{"title":"Cache-Persistence-Aware Response-Time Analysis for Fixed-Priority Preemptive Systems","authors":"Syed Aftab Rashid, Geoffrey Nelissen, D. Hardy, B. Akesson, I. Puaut, E. Tovar","doi":"10.1109/ECRTS.2016.25","DOIUrl":"https://doi.org/10.1109/ECRTS.2016.25","url":null,"abstract":"A task can be preempted by several jobs of higher priority tasks during its response time. Assuming the worst-case memory demand for each of these jobs leads to pessimistic worst-case response time (WCRT) estimations. Indeed, there is a big chance that a large portion of the instructions and data associated with the preempting task Tj are still available in the cache when Tj releases its next jobs. Accounting for this observation allows the pessimism of WCRT analysis to be significantly reduced, which is not considered by existing work. The four main contributions of this paper are: 1) The concept of persistent cache blocks is introduced in the context of WCRT analysis, which allows re-use of cache blocks to be captured,2) A cache-persistence-aware WCRT analysis for fixed-priority preemptive systems exploiting the PCBs to reduce the WCRT bound, 3) A multi-set extension of the analysis that further improves the WCRT bound and 4) An evaluation showing that our cache-persistence-aware WCRT analysis results in up to 10%higher schedulability than state-of-the-art approaches.","PeriodicalId":178974,"journal":{"name":"2016 28th Euromicro Conference on Real-Time Systems (ECRTS)","volume":"376 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114883728","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}
引用次数: 6
Mixed-Criticality Scheduling with I/O I/O混合临界调度
2016 28th Euromicro Conference on Real-Time Systems (ECRTS) Pub Date : 2015-12-23 DOI: 10.1109/ECRTS.2016.13
Eric S. Missimer, Katherine Missimer, R. West
{"title":"Mixed-Criticality Scheduling with I/O","authors":"Eric S. Missimer, Katherine Missimer, R. West","doi":"10.1109/ECRTS.2016.13","DOIUrl":"https://doi.org/10.1109/ECRTS.2016.13","url":null,"abstract":"This paper addresses the problem of scheduling tasks with differentcriticality levels in the presence of I/O requests. In mixed-criticalityscheduling, higher criticality tasks are given precedence over those of lowercriticality when it is impossible to guarantee the schedulability of alltasks. While mixed-criticality scheduling has gained attention in recentyears, most approaches typically assume a periodic task model. Thisassumption does not always hold in practice, especially for real-time andembedded systems that perform I/O. In prior work, we developed ascheduling technique in the Quest real-time operating system, which integratesthe time-budgeted management of I/O operations with Sporadic Server schedulingof tasks. This paper extends our previous scheduling approach with support formixed-criticality tasks and I/O requests on the same processing core. Resultsshow that in a real implementation the mixed-criticality scheduling methodintroduced in this paper outperforms a scheduling approach consisting of onlySporadic Servers.","PeriodicalId":178974,"journal":{"name":"2016 28th Euromicro Conference on Real-Time Systems (ECRTS)","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130359015","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
Partitioned Multiprocessor Fixed-Priority Scheduling of Sporadic Real-Time Tasks 零星实时任务的分区多处理机固定优先级调度
2016 28th Euromicro Conference on Real-Time Systems (ECRTS) Pub Date : 2015-05-18 DOI: 10.1109/ECRTS.2016.26
Jian-Jia Chen
{"title":"Partitioned Multiprocessor Fixed-Priority Scheduling of Sporadic Real-Time Tasks","authors":"Jian-Jia Chen","doi":"10.1109/ECRTS.2016.26","DOIUrl":"https://doi.org/10.1109/ECRTS.2016.26","url":null,"abstract":"Partitioned multiprocessor scheduling has been widely accepted in academia and industry to statically assign and partition real-time tasks onto identical multiprocessor systems. This paper studies fixed-priority partitioned multiprocessor scheduling for sporadic real-time systems, in which deadline-monotonic scheduling is applied on each processor. Prior to this paper, the best known results are by Fisher, Baruah, and Baker with speedup factors 4-2/M and 3-1/M for arbitrary-deadline and constrained-deadline sporadic real-time task systems, respectively, where M is the number of processors. We show that a greedy mapping strategy has a speedup factor 3-1/M when considering task systems with arbitrary deadlines. Such a factor holds for polynomial-time schedulability tests and exponential-time (exact) schedulability tests. Moreover, we also improve the speedup factor to 2.84306 when considering constrained-deadline task systems. We also provide tight examples when the fitting strategy in the mapping stage is arbitrary and M is sufficiently large. For both constrained-and arbitrary-deadline task systems, the analytical result surprisingly shows that using exact tests does not gain theoretical benefits (with respect to speedup factors) if the speedup factor analysis is oblivious of the particular fitting strategy used.","PeriodicalId":178974,"journal":{"name":"2016 28th Euromicro Conference on Real-Time Systems (ECRTS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134433540","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
首页 上一页
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学术官方微信