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

2012 24th Euromicro Conference on Real-Time Systems最新文献

筛选
英文 中文
Measurement-Based Probabilistic Timing Analysis for Multi-path Programs 基于测量的多路径程序概率时序分析
2012 24th Euromicro Conference on Real-Time Systems Pub Date : 2012-07-11 DOI: 10.1109/ECRTS.2012.31
L. Cucu-Grosjean, L. Santinelli, Michael Houston, Code Lo, T. Vardanega, Leonidas Kosmidis, J. Abella, E. Mezzetti, E. Quiñones, F. Cazorla
{"title":"Measurement-Based Probabilistic Timing Analysis for Multi-path Programs","authors":"L. Cucu-Grosjean, L. Santinelli, Michael Houston, Code Lo, T. Vardanega, Leonidas Kosmidis, J. Abella, E. Mezzetti, E. Quiñones, F. Cazorla","doi":"10.1109/ECRTS.2012.31","DOIUrl":"https://doi.org/10.1109/ECRTS.2012.31","url":null,"abstract":"The rigorous application of static timing analysis requires a large and costly amount of detail knowledge on the hardware and software components of the system. Probabilistic Timing Analysis has potential for reducing the weight of that demand. In this paper, we present a sound measurement-based probabilistic timing analysis technique based on Extreme Value Theory. In all the experiments made as part of this work, the timing bounds determined by our technique were less than 15% pessimistic in comparison with the tightest possible bounds obtainable with any probabilistic timing analysis technique. As a point of interest to industrial users, our technique also requires a comparatively low number of measurement runs of the program under analysis, less than 650 runs were needed for the benchmarks presented in this paper.","PeriodicalId":425794,"journal":{"name":"2012 24th Euromicro Conference on Real-Time Systems","volume":"5 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120987152","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}
引用次数: 260
Schedulability Analysis of Periodic Tasks Implementing Synchronous Finite State Machines 实现同步有限状态机的周期任务可调度性分析
2012 24th Euromicro Conference on Real-Time Systems Pub Date : 2012-07-11 DOI: 10.1109/ECRTS.2012.30
Haibo Zeng, M. Natale
{"title":"Schedulability Analysis of Periodic Tasks Implementing Synchronous Finite State Machines","authors":"Haibo Zeng, M. Natale","doi":"10.1109/ECRTS.2012.30","DOIUrl":"https://doi.org/10.1109/ECRTS.2012.30","url":null,"abstract":"Model-based design of embedded systems using Synchronous Reactive (SR) models is among the best practices for software development in the automotive and aeronautics industry. The correct implementation of an SR model must guarantee the synchronous assumption, that is, all the system reactions complete before the next event. This assumption can be verified using schedulability analysis, but the analysis can be quite challenging when the system also consists of blocks implementing finite state machines, as in modern modeling tools like Simulink and SCADE. In this paper, we discuss the schedulability analysis of such systems, including the applicability of traditional task analysis methods and an algorithmic solution to compute the exact demand and request bound functions. In addition, we define conditions for computing these functions using a periodic recurrent term, even when there is no cyclic recurrent behavior in the model.","PeriodicalId":425794,"journal":{"name":"2012 24th Euromicro Conference on Real-Time Systems","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116074795","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}
引用次数: 24
Parallel-Task Scheduling on Multiple Resources 多资源并行任务调度
2012 24th Euromicro Conference on Real-Time Systems Pub Date : 2012-07-11 DOI: 10.1109/ECRTS.2012.33
M. Holenderski, R. J. Bril, J. Lukkien
{"title":"Parallel-Task Scheduling on Multiple Resources","authors":"M. Holenderski, R. J. Bril, J. Lukkien","doi":"10.1109/ECRTS.2012.33","DOIUrl":"https://doi.org/10.1109/ECRTS.2012.33","url":null,"abstract":"This paper addresses the problem of scheduling periodic parallel tasks on a multi-resource platform, where tasks have real-time constraints. The goal is to exploit the inherent parallelism of a platform comprised of multiple heterogeneous resources. A resource model is proposed, which abstracts the key properties of any heterogeneous resource from a scheduling perspective. A new scheduling algorithm called PSRP is presented, which refines MSRP. The schedulability analysis for PSRP is presented. The benefits of PSRP are demonstrated by means of an example application showing that PSRP indeed exploits the available concurrency in heterogeneous real-time systems.","PeriodicalId":425794,"journal":{"name":"2012 24th Euromicro Conference on Real-Time Systems","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122971808","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}
引用次数: 16
The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems 混合临界隐式截止时间偶发任务系统的单处理机抢占调度
2012 24th Euromicro Conference on Real-Time Systems Pub Date : 2012-07-11 DOI: 10.1109/ECRTS.2012.42
Sanjoy Baruah, V. Bonifaci, Gianlorenzo D'angelo, Haohan Li, A. Marchetti-Spaccamela, S. Ster, L. Stougie
{"title":"The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems","authors":"Sanjoy Baruah, V. Bonifaci, Gianlorenzo D'angelo, Haohan Li, A. Marchetti-Spaccamela, S. Ster, L. Stougie","doi":"10.1109/ECRTS.2012.42","DOIUrl":"https://doi.org/10.1109/ECRTS.2012.42","url":null,"abstract":"Systems in many safety-critical application domains are subject to certification requirements. For any given system, however, it may be the case that only a subset of its functionality is safety-critical and hence subject to certification, the rest of the functionality is non safety critical and does not need to be certified, or is certified to a lower level of assurance. An algorithm called EDF-VD (for Earliest Deadline First with Virtual Deadlines) is described for the scheduling of such mixed-criticality task systems. Analyses of EDF-VD significantly superior to previously-known ones are presented, based on metrics such as processor speedup factor (EDF-VD is proved to be optimal with respect to this metric) and utilization bounds.","PeriodicalId":425794,"journal":{"name":"2012 24th Euromicro Conference on Real-Time Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129111677","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}
引用次数: 253
U-EDF: An Unfair But Optimal Multiprocessor Scheduling Algorithm for Sporadic Tasks 一种不公平但最优的零星任务多处理器调度算法
2012 24th Euromicro Conference on Real-Time Systems Pub Date : 2012-07-11 DOI: 10.1109/ECRTS.2012.36
Geoffrey Nelissen, V. Berten, Vincent Nélis, J. Goossens, D. Milojevic
{"title":"U-EDF: An Unfair But Optimal Multiprocessor Scheduling Algorithm for Sporadic Tasks","authors":"Geoffrey Nelissen, V. Berten, Vincent Nélis, J. Goossens, D. Milojevic","doi":"10.1109/ECRTS.2012.36","DOIUrl":"https://doi.org/10.1109/ECRTS.2012.36","url":null,"abstract":"A multiprocessor scheduling algorithm named U-EDF, was presented in [1] for the scheduling of periodic tasks with implicit deadlines. It was claimed that U-EDF is optimal for periodic tasks (i.e., it can meet all deadlines of every schedulable task set) and extensive simulations showed a drastic improvement in the number of task preemptions and migrations in comparison to state-of-the-art optimal algorithms. However, there was no proof of its optimality and U-EDF was not designed to schedule sporadic tasks. In this work, we propose a generalization of U-EDF for the scheduling of sporadic tasks with implicit deadlines, and we prove its optimality. Contrarily to all other existing optimal multiprocessor scheduling algorithms for sporadic tasks, U-EDF is not based on the fairness property. Instead, it extends the main principles of EDF so that it achieves optimality while benefiting from a substantial reduction in the number of preemptions and migrations.","PeriodicalId":425794,"journal":{"name":"2012 24th Euromicro Conference on Real-Time Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124470370","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}
引用次数: 78
An Algorithm for Online Reconfiguration of Resource Reservations for Hard Real-Time Systems 硬实时系统资源预约在线重构算法
2012 24th Euromicro Conference on Real-Time Systems Pub Date : 2012-07-11 DOI: 10.1109/ECRTS.2012.28
Pratyush Kumar, N. Stoimenov, L. Thiele
{"title":"An Algorithm for Online Reconfiguration of Resource Reservations for Hard Real-Time Systems","authors":"Pratyush Kumar, N. Stoimenov, L. Thiele","doi":"10.1109/ECRTS.2012.28","DOIUrl":"https://doi.org/10.1109/ECRTS.2012.28","url":null,"abstract":"Nowadays, real-time applications expect the supporting computing system to be reconfigured at run-time. Even during such reconfiguration, timing requirements of the applications must be met. By extension, such requirements are relevant in the design of resource reservations techniques. In this work, we consider such a reconfiguration of the reservation provided by a constant bandwidth server (CBS). Firstly, we de-fine an exact notion of correctness of a server's reconfiguration. Then we design a provably correct server algorithm R-CBS that allows for run-time reconfiguration of a standard CBS. The algorithm maintains specific information about the execution trace and uses it to efficiently perform the reconfiguration at the earliest possible time. We highlight the advantages of R-CBS in comparison to reconfiguration of TDMA servers and in reconfiguring multiple servers simultaneously.","PeriodicalId":425794,"journal":{"name":"2012 24th Euromicro Conference on Real-Time Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134102751","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
Real-Time Competitive Environments: Truthful Mechanisms for Allocating a Single Processor to Sporadic Tasks 实时竞争环境:分配单个处理器到零星任务的真实机制
2012 24th Euromicro Conference on Real-Time Systems Pub Date : 2012-07-11 DOI: 10.1109/ECRTS.2012.25
Anwar Mohammadi, N. Fisher, Daniel Grosu
{"title":"Real-Time Competitive Environments: Truthful Mechanisms for Allocating a Single Processor to Sporadic Tasks","authors":"Anwar Mohammadi, N. Fisher, Daniel Grosu","doi":"10.1109/ECRTS.2012.25","DOIUrl":"https://doi.org/10.1109/ECRTS.2012.25","url":null,"abstract":"In a non-competitive environment, sporadic real time task scheduling on a single processor is well understood. In this paper, we consider a competitive environment comprising several real-time tasks vying for execution upon a shared single processor. Each task obtains a value if the processor successfully schedules all its jobs. Our objective is to select a feasible subset of these tasks to maximize the sum of values of selected tasks. There are algorithms for solving this problem in non-competitive settings. However, we consider this problem in an economic setting in which each task is owned by a selfish agent. Each agent reports the characteristics of her own task to the processor owner. The processor owner uses a mechanism to allocate the processor to a subset of agents and to determine the payment of each agent. Since agents are selfish, they may try to manipulate the mechanism to obtain the processor. We are interested in truthful mechanisms in which it is always in agents' best interest to report the true characteristics of their tasks. We design exact and approximate truthful mechanisms for this competitive environment and study their performance.","PeriodicalId":425794,"journal":{"name":"2012 24th Euromicro Conference on Real-Time Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131083063","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
A Sensitivity Analysis of Two Worst-Case Delay Computation Methods for SpaceWire Networks 空间线网络两种最坏情况时延计算方法的灵敏度分析
2012 24th Euromicro Conference on Real-Time Systems Pub Date : 2012-07-11 DOI: 10.1109/ECRTS.2012.35
Thomas Ferrandiz, F. Frances, C. Fraboul
{"title":"A Sensitivity Analysis of Two Worst-Case Delay Computation Methods for SpaceWire Networks","authors":"Thomas Ferrandiz, F. Frances, C. Fraboul","doi":"10.1109/ECRTS.2012.35","DOIUrl":"https://doi.org/10.1109/ECRTS.2012.35","url":null,"abstract":"Space Wire is a standard of on-board networks for satellites promoted by the ESA. As the ESA plans to use Space Wire as the sole network for both critical and non-critical traffics, network designers need tools to check that all the critical messages meet their deadlines. We previously proposed two such tools to compute an upper-bound on the worst-case end-to-end delay of a packet traversing a Space Wire network. The main contribution of this paper is the comparison of those two methods on a network configuration provided by Thales Alenia Space that is representative of next generation large satellites. The goal is to identify the key parameters that affect the bounds computed by the methods. We then conduct a sensitivity analysis on simpler network configurations to study the impact of those parameters on the methods and determine which method works better in different situations.","PeriodicalId":425794,"journal":{"name":"2012 24th Euromicro Conference on Real-Time Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116341752","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}
引用次数: 23
Non-preemptive Scheduling with History-Dependent Execution Time 执行时间依赖历史的非抢占调度
2012 24th Euromicro Conference on Real-Time Systems Pub Date : 2012-07-11 DOI: 10.1109/ECRTS.2012.38
Björn Andersson, S. Chaki, Dionisio de Niz, B. Dougherty, R. Kegley, Jules White
{"title":"Non-preemptive Scheduling with History-Dependent Execution Time","authors":"Björn Andersson, S. Chaki, Dionisio de Niz, B. Dougherty, R. Kegley, Jules White","doi":"10.1109/ECRTS.2012.38","DOIUrl":"https://doi.org/10.1109/ECRTS.2012.38","url":null,"abstract":"Consider non-preemptive fixed-priority scheduling of arbitrary-deadline sporadic tasks on a single processor assuming that the execution time of a job J depends on the actual schedule (sequence) of jobs executed before J. We present exact schedulability analysis for such a system.","PeriodicalId":425794,"journal":{"name":"2012 24th Euromicro Conference on Real-Time Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122463347","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}
引用次数: 5
Memory Access Control in Multiprocessor for Real-Time Systems with Mixed Criticality 混合临界实时系统的多处理器存储器访问控制
2012 24th Euromicro Conference on Real-Time Systems Pub Date : 2012-07-11 DOI: 10.1109/ECRTS.2012.32
H. Yun, Gang Yao, R. Pellizzoni, M. Caccamo, L. Sha
{"title":"Memory Access Control in Multiprocessor for Real-Time Systems with Mixed Criticality","authors":"H. Yun, Gang Yao, R. Pellizzoni, M. Caccamo, L. Sha","doi":"10.1109/ECRTS.2012.32","DOIUrl":"https://doi.org/10.1109/ECRTS.2012.32","url":null,"abstract":"Shared resource access interference, particularly memory and system bus, is a big challenge in designing predictable real-time systems because its worst case behavior can significantly differ. In this paper, we propose a software based memory throttling mechanism to explicitly control the memory interference. We developed analytic solutions to compute proper throttling parameters that satisfy schedulability of critical tasks while minimize performance impact caused by throttling. We implemented the mechanism in Linux kernel and evaluated isolation guarantee and overall performance impact using a set of synthetic and real applications.","PeriodicalId":425794,"journal":{"name":"2012 24th Euromicro Conference on Real-Time Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132023157","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}
引用次数: 146
下一页 尾页
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学术官方微信