International Conference on Real-Time and Network Systems最新文献_第2页

Optimal procrastination interval for constrained deadline sporadic tasks upon uniprocessors 单处理器上约束截止日期零星任务的最优拖延间隔

International Conference on Real-Time and Network Systems Pub Date : 2013-10-16 DOI: 10.1145/2516821.2516837

Muhammad Ali Awan, P. Yomsi, Stefan M. Petters

引用次数: 8

Improved feasibility of fixed-priority scheduling with deferred preemption using preemption thresholds for preemption points 使用抢占点的抢占阈值改进了延迟抢占的固定优先级调度的可行性

International Conference on Real-Time and Network Systems Pub Date : 2013-10-16 DOI: 10.1145/2516821.2516824

R. J. Bril, M. V. D. Heuvel, J. Lukkien

引用次数: 11

Global EDF scheduling of directed acyclic graphs on multiprocessor systems 多处理器系统上有向无环图的全局EDF调度

International Conference on Real-Time and Network Systems Pub Date : 2013-10-16 DOI: 10.1145/2516821.2516836

Manar Qamhieh, Frédéric Fauberteau, L. George, Serge Midonnet

引用次数: 87

Best-case response times and jitter analysis of real-time tasks with arbitrary deadlines 具有任意截止日期的实时任务的最佳情况响应时间和抖动分析

International Conference on Real-Time and Network Systems Pub Date : 2013-10-16 DOI: 10.1145/2516821.2516825

R. J. Bril, J. Lukkien, R. H. Mak

引用次数: 11

Leveraging transactional memory for a predictable execution of applications composed of hard real-time and best-effort tasks 利用事务性内存实现由硬实时和尽最大努力完成的任务组成的应用程序的可预测执行

International Conference on Real-Time and Network Systems Pub Date : 2013-10-16 DOI: 10.1145/2516821.2516832

Stefan Metzlaff, Sebastian Weis, T. Ungerer

引用次数: 6

Continuity for network calculus 网络微积分的连续性

International Conference on Real-Time and Network Systems Pub Date : 2013-10-16 DOI: 10.1145/2516821.2516840

M. Boyer, G. Dufour, L. Santinelli

引用次数: 11

Feasibility intervals for homogeneous multicores, asynchronous periodic tasks, and FJP schedulers 同构多核、异步周期性任务和FJP调度器的可行性间隔

International Conference on Real-Time and Network Systems Pub Date : 2013-10-16 DOI: 10.1145/2516821.2516848

Vincent Nélis, P. Yomsi, J. Goossens

引用次数: 13

Fixed-priority scheduling of dual-criticality systems 双临界系统的固定优先级调度

International Conference on Real-Time and Network Systems Pub Date : 2013-10-16 DOI: 10.1145/2516821.2516827

Sanjoy Baruah, A. Burns

引用次数: 14

A scheduling algorithm to reduce the static energy consumption of multiprocessor real-time systems 一种减少多处理器实时系统静态能耗的调度算法

International Conference on Real-Time and Network Systems Pub Date : 2013-10-16 DOI: 10.1145/2516821.2516839

Vincent Legout, M. Jan, L. Pautet

{"title":"A scheduling algorithm to reduce the static energy consumption of multiprocessor real-time systems","authors":"Vincent Legout, M. Jan, L. Pautet","doi":"10.1145/2516821.2516839","DOIUrl":"https://doi.org/10.1145/2516821.2516839","url":null,"abstract":"Energy consumption of real-time embedded systems is a growing concern. It includes both static and dynamic consumption and is now dominated by static consumption as the semiconductor technology moves to deep sub-micron scale. In this paper, we propose a new approach to efficiently use the low-power states of multiprocessor embedded hard real-time systems in order to reduce their static consumption. In a low-power state, the processor is not active and the deeper the low-power state is, the lower is the energy consumption but the higher is the transition delay to come back to the active state. Our approach increases the duration of the idle periods to allow the activation of deeper low-power states. Offline, we use an additional task to model the idle time and we use mixed integer linear programming to reduce its number of preemptions. Online, we extend an existing scheduling algorithm to increase the length of the idle periods. To the best of our knowledge, this is the first optimal multiprocessor scheduling algorithm minimizing static consumption. Simulations show that the energy consumption while processors are idle is dramatically reduced with our solution compared to existing multiprocessor real-time scheduling algorithms.","PeriodicalId":190397,"journal":{"name":"International Conference on Real-Time and Network Systems","volume":"2018 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128070995","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}

引用次数: 14

An optimisation algorithm for minimising energy dissipation in NoC-based hard real-time embedded systems 基于noc的硬实时嵌入式系统中能量消耗最小化的优化算法

International Conference on Real-Time and Network Systems Pub Date : 2013-10-16 DOI: 10.1145/2516821.2516844

M. Sayuti, L. Indrusiak, A. Ortiz

{"title":"An optimisation algorithm for minimising energy dissipation in NoC-based hard real-time embedded systems","authors":"M. Sayuti, L. Indrusiak, A. Ortiz","doi":"10.1145/2516821.2516844","DOIUrl":"https://doi.org/10.1145/2516821.2516844","url":null,"abstract":"This paper introduces an evolutionary multi-objective optimisation algorithm to facilitate fast and efficient task allocation of hard real-time embedded systems with Networks-On-Chip (NoC) as the interconnection at the early design stage, where evaluating as many as possible solutions is crucial. Our approach uses analytical fitness functions to provide fast evaluation of large number of solutions; a contrast to simulation-based optimisation technique, whereby it tends to be not only impractical when the design space is very large but also unfeasible as far as hard real-time systems are concerned. The proposed algorithm guarantees the predictability in timing behaviour of the systems whilst minimising energy dissipation whenever tasks are reallocated and their packets are rerouted, which differs from the state-of-the-art approaches. In addition, not only it can explore the allocation of tasks but also the encoding of the data packets. The evidence gathered from case studies shows that the proposed algorithm is able to find schedulable allocation of tasks, preserving it whilst further minimising energy dissipation.","PeriodicalId":190397,"journal":{"name":"International Conference on Real-Time and Network Systems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130346631","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}

引用次数: 17