International Conference on Real-Time and Network Systems最新文献

An Efficient Proactive Thermal-Aware Scheduler for DVFS-enabled Single-Core Processors 用于支持dvfs的单核处理器的高效主动热感知调度器

International Conference on Real-Time and Network Systems Pub Date : 2021-04-07 DOI: 10.1145/3453417.3453430

Javier Pérez-Rodríguez, P. Yomsi

{"title":"An Efficient Proactive Thermal-Aware Scheduler for DVFS-enabled Single-Core Processors","authors":"Javier Pérez-Rodríguez, P. Yomsi","doi":"10.1145/3453417.3453430","DOIUrl":"https://doi.org/10.1145/3453417.3453430","url":null,"abstract":"For decades now, thermal rise has been spotted as one of the major constraints of performance for high-end safety-critical processors. In this context, Dynamic Voltage and Frequency Scaling () based solutions have proven to be effective to manage the chip temperature. In this paper, we consider the scheduling problem of non-preemptive periodic tasks on a single-core processor with DVFS-enabled capabilities under thermal-aware design. We assume that the tasks are scheduled by following any Fixed-Task-Priority (FTP) scheduler such as the traditional Rate Monotonic (RM) and Deadline Monotonic (DM). Then, we propose a new scheduling scheme, referred to as NP-COIN, which makes it possible to control both the processor activity and the triggering of the cooling mechanism with as little impact on performance as possible. We provide a thorough theoretical analysis of our solution, in terms of average temperature gain and timing penalty, against the classical schedule. Finally, we validate our theoretical results and assess the performance of our solution through a real-world use-case study from the avionics domain and through intensive simulations by using synthetic test cases.","PeriodicalId":190397,"journal":{"name":"International Conference on Real-Time and Network Systems","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116237628","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}

引用次数: 1

Energy-aware design of secure multi-mode real-time embedded systems with FPGA co-processors 基于FPGA协处理器的安全多模实时嵌入式系统的能量感知设计

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

Ke Jiang, A. Lifa, P. Eles, Zebo Peng, Wei Jiang

引用次数: 8

Thermal analysis of periodic real-time systems with stochastic properties: an analytical approach 具有随机特性的周期性实时系统的热分析:一种分析方法

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

M. Mohaqeqi, M. Kargahi

引用次数: 2

Approximation scheme for real-time tasks under fixed-priority scheduling with deferred preemption 具有延迟抢占的固定优先级调度下实时任务的逼近方案

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

T. Nguyen, Ngoc Son Tran, V. H. Le, P. Richard

引用次数: 6

Formal approach to guard time optimization for TDMA TDMA保护时间优化的形式化方法

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

Oday Jubran, B. Westphal

引用次数: 7

An experimental evaluation of synchronization protocol mechanisms in the domain of hierarchical fixed-priority scheduling 分级固定优先级调度领域同步协议机制的实验评估

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

M. Åsberg, M. Behnam, Thomas Nolte

{"title":"An experimental evaluation of synchronization protocol mechanisms in the domain of hierarchical fixed-priority scheduling","authors":"M. Åsberg, M. Behnam, Thomas Nolte","doi":"10.1145/2516821.2516823","DOIUrl":"https://doi.org/10.1145/2516821.2516823","url":null,"abstract":"This paper presents an extensive implementation study where we evaluate and compare different synchronization protocol mechanisms within the domain of two-level hierarchical fixed-priority preemptive scheduling. These protocol mechanisms include HSRPnP (Hierarchical Stack Resource Policy no Payback), HSRPwP (Hierarchical Stack Resource Policy with Payback), SIRAP (Subsystem Integration and Resource Allocation Policy), RRP (Rollback Resource Policy) and SRPwD (Stack Resource Policy with Donation). In an attempt to shed new light to the research in this area, we focus on the actual software implementation of these protocols in a widely used real-time operating system (VxWorks). This study is not based on worst-case schedulability analysis which is the most common angle of work in this research field. All five protocols have been implemented, tested and executed for several months with many different parameters, for example; variant number of subsystems, number of resources, system utilization settings, resource allocation strategies etc. These tests generated a large amount of useful data, for example, protocol overhead, effective subsystem utilization, number of protocol mechanism invocations etc. Due to the large complexity and size of this data, we analyzed the data with state-of-the-art statistical methods and tools (Principal Component Analysis) in order to grasp the efficiency of the protocols with respect to a large number of different parameters.","PeriodicalId":190397,"journal":{"name":"International Conference on Real-Time and Network Systems","volume":"28 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":"114224978","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}

引用次数: 8

A delay density model for networked control systems 网络化控制系统的延迟密度模型

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

T. Bund, F. Slomka

引用次数: 5

Quality of service capabilities for hard real-time applications on multi-core processors 多核处理器上硬实时应用程序的服务质量能力

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

Jan Nowotsch, M. Paulitsch

{"title":"Quality of service capabilities for hard real-time applications on multi-core processors","authors":"Jan Nowotsch, M. Paulitsch","doi":"10.1145/2516821.2516826","DOIUrl":"https://doi.org/10.1145/2516821.2516826","url":null,"abstract":"Computing Worst-Case Execution Times (WCETs) for applications executed on multi-core processors is a challenging topic since possible interferences on shared resources need to be considered. Some approaches are already proposed in literature, but the problem is still not sufficiently solved. Different approaches suffer different shortcomings. For instance, the mutual analysis of multiple applications leads to great computational complexity, pessimistic assumptions on the interference between tasks causes highly overestimated WCETs and resource privatisation dissipates processor resources. In this paper we tackle the problems of overestimated WCETs due to pessimistic analysis and differences between average-case and worst-case execution timing. We introduce a new computing paradigm for safety-critical real-time systems, which enables Quality of Service (QoS) properties to increase the utilisation of multi-core processors while still guaranteeing bounds on the worst-case behavior. This paradigm is one approach to raise multi-core performance over single-core processors, even for hard real-time systems. For evaluation we use abstractions of real applications. The concepts are implemented on Freescale's P4080 multi-core processor and AbsInt's timing analysis framework aiT. The results show an increased processor core and system utilisation of up to 99.9% and 59.3% respectively, while still providing hard deadline guarantees for all applications.","PeriodicalId":190397,"journal":{"name":"International Conference on Real-Time and Network Systems","volume":"14 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":"123922019","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}

引用次数: 29

Are virtual channels the bottleneck of priority-aware wormhole-switched NoC-based many-cores? 虚拟通道是基于优先级感知的虫洞交换的多核网络的瓶颈吗?

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

Borislav Nikolic, H. Ali, Stefan M. Petters, L. M. Pinho

引用次数: 37

Formal verification of real-time wireless sensor networks protocols with realistic radio links 具有实际无线电链路的实时无线传感器网络协议的正式验证

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

Alexandre Mouradian, I. Augé-Blum

{"title":"Formal verification of real-time wireless sensor networks protocols with realistic radio links","authors":"Alexandre Mouradian, I. Augé-Blum","doi":"10.1145/2516821.2516833","DOIUrl":"https://doi.org/10.1145/2516821.2516833","url":null,"abstract":"Many critical applications which rely on Wireless Sensor Networks (WSNs) are proposed. Forest fire detection, landslide detection and intrusion detection are some examples. Critical applications require correct behavior, reliability, and the respect of time constraints. Otherwise, if they fail, consequences on human life and the environment could be catastrophic. For this reason, the WSN protocols used in these applications must be formally verified. Unfortunately the radio link is unreliable, it is thus difficult to give hard guarantees on the temporal behavior of the protocols (on wired systems the link error probability is very low [7], so they are considered reliable). Indeed, a message may experience a very high number of retransmissions. The temporal guarantee has thus to be given with a probability that it is achieved. This probability must meet the requirements of the application.\u0000 Network protocols have been successfully verified on a given network topology without taking into account unreliable links. Nevertheless, the probabilistic nature of radio links may change the topology (links which appear and disappear). Thus instead of a single topology we have a set of possible topologies, each topology having a probability to exist. In this paper, we propose a method that produces the set of topologies, checks the property on every topology, and gives the probability that the property is verified. This technique is independent from the verification technique, i.e. each topology can be verified using any formal method which can give a \"yes\" or \"no\" answer to the question: \"Does the model of the protocol respect the property?\".\u0000 In this paper we apply this method on f-MAC [23] protocol. F-MAC is a real-time medium access protocol for WSNs. We use UPPAAL model checker [10] as verification tool. We perform simulations to observe the difference between average and worst case behaviors.","PeriodicalId":190397,"journal":{"name":"International Conference on Real-Time and Network Systems","volume":"41 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":"125034210","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}

引用次数: 7