首页 > 最新文献

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

英文 中文
Measurement-Based Probabilistic Timing Analysis for Multi-path Programs 基于测量的多路径程序概率时序分析
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
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.
静态时序分析的严格应用需要大量且昂贵的关于系统硬件和软件组件的详细知识。概率时序分析有可能减少这种需求的权重。本文提出了一种基于极值理论的基于声波测量的概率时序分析技术。在作为这项工作的一部分所做的所有实验中,与任何概率时序分析技术可获得的最严格的可能界限相比,我们的技术确定的时序界限的悲观程度小于15%。作为工业用户感兴趣的一点,我们的技术还需要相对较低数量的正在分析的程序的测量运行,本文中提供的基准测试所需的运行少于650次。
{"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 实现同步有限状态机的周期任务可调度性分析
Pub Date : 2012-07-11 DOI: 10.1109/ECRTS.2012.30
Haibo Zeng, M. Natale
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.
使用同步反应(SR)模型的嵌入式系统基于模型的设计是汽车和航空工业软件开发的最佳实践之一。SR模型的正确实现必须保证同步假设,即所有系统反应在下一个事件之前完成。这个假设可以使用可调度性分析来验证,但是当系统也由实现有限状态机的块组成时,就像在像Simulink和SCADE这样的现代建模工具中一样,这种分析可能相当具有挑战性。本文讨论了这类系统的可调度性分析,包括传统任务分析方法的适用性,以及计算精确需求函数和请求约束函数的算法解决方案。此外,我们定义了使用周期循环项计算这些函数的条件,即使在模型中没有循环循环行为。
{"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 多资源并行任务调度
Pub Date : 2012-07-11 DOI: 10.1109/ECRTS.2012.33
M. Holenderski, R. J. Bril, J. Lukkien
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.
研究了多资源平台上具有实时性约束的周期性并行任务调度问题。目标是利用由多个异构资源组成的平台的固有并行性。提出了一种资源模型,从调度的角度对异构资源的关键属性进行抽象。在MSRP算法的基础上,提出了一种新的调度算法PSRP。给出了PSRP的可调度性分析。通过一个应用实例说明了PSRP的优点,表明PSRP确实利用了异构实时系统中可用的并发性。
{"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 混合临界隐式截止时间偶发任务系统的单处理机抢占调度
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
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.
许多安全关键应用领域中的系统都要遵守认证要求。然而,对于任何给定的系统,可能只有其功能的一个子集是安全关键的,因此需要认证,其余的功能是非安全关键的,不需要认证,或者被认证到较低的保证级别。提出了一种用于混合临界任务系统调度的EDF-VD算法。基于处理器加速因子(EDF-VD被证明是最优的)和利用率界限等指标,对EDF-VD进行了明显优于先前已知的分析。
{"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 一种不公平但最优的零星任务多处理器调度算法
Pub Date : 2012-07-11 DOI: 10.1109/ECRTS.2012.36
Geoffrey Nelissen, V. Berten, Vincent Nélis, J. Goossens, D. Milojevic
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.
文献[1]提出了一种多处理器调度算法U-EDF,用于隐式截止日期的周期性任务调度。据称,U-EDF对于周期性任务是最优的(即,它可以满足每个可调度任务集的所有截止日期),广泛的模拟表明,与最先进的最优算法相比,U-EDF在任务抢占和迁移的数量上有了显着改善。然而,没有证据表明它是最优的,而且U-EDF不是为安排零星任务而设计的。在这项工作中,我们提出了具有隐式截止日期的零星任务调度的U-EDF的推广,并证明了它的最优性。与现有的针对零星任务的多处理器优化调度算法不同,U-EDF算法不以公平性为基础。相反,它扩展了EDF的主要原则,从而实现了最优性,同时受益于抢占和迁移数量的大幅减少。
{"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 硬实时系统资源预约在线重构算法
Pub Date : 2012-07-11 DOI: 10.1109/ECRTS.2012.28
Pratyush Kumar, N. Stoimenov, L. Thiele
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.
现在,实时应用程序期望支持的计算系统在运行时被重新配置。即使在这样的重新配置过程中,也必须满足应用程序的时序要求。推而广之,这些要求与资源保留技术的设计有关。在这项工作中,我们考虑了这种由恒定带宽服务器(CBS)提供的预约的重新配置。首先,我们定义了服务器重新配置正确性的确切概念。然后,我们设计了一个可证明正确的服务器算法R-CBS,它允许标准CBS的运行时重新配置。该算法维护有关执行跟踪的特定信息,并使用它在尽可能早的时间有效地执行重新配置。我们强调了与TDMA服务器的重新配置和同时重新配置多个服务器相比,R-CBS的优势。
{"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 实时竞争环境:分配单个处理器到零星任务的真实机制
Pub Date : 2012-07-11 DOI: 10.1109/ECRTS.2012.25
Anwar Mohammadi, N. Fisher, Daniel Grosu
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.
在非竞争环境中,可以很好地理解单个处理器上的零星实时任务调度。在本文中,我们考虑一个竞争环境,包括几个实时任务争夺在共享的单个处理器上执行。如果处理器成功调度其所有作业,则每个任务获得一个值。我们的目标是选择这些任务的一个可行子集,以最大化所选任务的值之和。有一些算法可以在非竞争环境下解决这个问题。然而,我们在一个经济环境中考虑这个问题,其中每个任务都由一个自私的代理拥有。每个代理向处理器所有者报告自己任务的特征。处理器所有者使用一种机制将处理器分配给代理子集,并确定每个代理的支付。由于代理是自私的,它们可能试图操纵机制来获得处理器。我们感兴趣的是真实的机制,在这种机制中,智能体报告其任务的真实特征总是符合其最大利益。我们为这种竞争环境设计了精确和近似真实的机制,并研究了它们的性能。
{"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 空间线网络两种最坏情况时延计算方法的灵敏度分析
Pub Date : 2012-07-11 DOI: 10.1109/ECRTS.2012.35
Thomas Ferrandiz, F. Frances, C. Fraboul
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.
太空线是欧洲航天局推广的卫星机载网络标准。由于欧空局计划使用空间线作为关键和非关键流量的唯一网络,网络设计者需要工具来检查所有关键消息是否符合他们的截止日期。我们之前提出了两个这样的工具来计算穿越空间线网络的数据包的最坏情况端到端延迟的上限。本文的主要贡献是在泰利斯阿莱尼亚空间公司提供的网络配置上对这两种方法进行比较,该网络配置是下一代大型卫星的代表。目标是确定影响方法计算的边界的关键参数。然后,我们对更简单的网络配置进行敏感性分析,研究这些参数对方法的影响,并确定哪种方法在不同情况下效果更好。
{"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 执行时间依赖历史的非抢占调度
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
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.
假设作业J的执行时间取决于在J之前执行的作业的实际调度(顺序),考虑在单个处理器上任意截止日期零星任务的非抢占式固定优先级调度。
{"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 混合临界实时系统的多处理器存储器访问控制
Pub Date : 2012-07-11 DOI: 10.1109/ECRTS.2012.32
H. Yun, Gang Yao, R. Pellizzoni, M. Caccamo, L. Sha
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.
共享资源访问干扰,特别是内存和系统总线,是设计可预测的实时系统的一大挑战,因为其最坏情况的行为可能会有很大的不同。本文提出了一种基于软件的内存节流机制来显式控制内存干扰。我们开发了解析解决方案来计算适当的节流参数,以满足关键任务的可调度性,同时最大限度地减少节流对性能的影响。我们在Linux内核中实现了该机制,并使用一组合成的和真实的应用程序评估了隔离保证和总体性能影响。
{"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
期刊
2012 24th Euromicro Conference on Real-Time Systems
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1