2015 IEEE Real-Time Systems Symposium最新文献_第3页

Real-Time Support in the Proposal for Fine-Grained Parallelism in Ada Ada中细粒度并行方案的实时支持

2015 IEEE Real-Time Systems Symposium Pub Date : 2015-12-01 DOI: 10.1109/RTSS.2015.43

L. M. Pinho, B. Moore, S. Michell, S. Taft

引用次数: 0

Optimal Real-Time Scheduling on Two-Type Heterogeneous Multicore Platforms 两型异构多核平台的最优实时调度

2015 IEEE Real-Time Systems Symposium Pub Date : 2015-12-01 DOI: 10.1109/RTSS.2015.19

H. Chwa, Jaebaek Seo, Jinkyu Lee, I. Shin

{"title":"Optimal Real-Time Scheduling on Two-Type Heterogeneous Multicore Platforms","authors":"H. Chwa, Jaebaek Seo, Jinkyu Lee, I. Shin","doi":"10.1109/RTSS.2015.19","DOIUrl":"https://doi.org/10.1109/RTSS.2015.19","url":null,"abstract":"Motivated by the cutting-edge two-type heterogeneous multicore chips, such as ARM's big.LITTLE, that offer a practical support for migration, this paper studies the global (or fully-migrative) approach to two-type heterogeneous multicore scheduling. Our goal is to design an optimal fully-migrative scheduling framework. To achieve this goal in an efficient and simple manner, we break the scheduling problem into two subproblems: workload assignment and schedule generation. We propose a per-cluster workload assignment algorithm, called Hetero-Split, that determines the fractions of workload of each task to be assigned to both clusters without losing feasibility with the complexity of O(n log n), where n is the number of tasks. Furthermore, it provides a couple of important properties (e.g., a dual property) that help to generate an optimal schedule efficiently. We also derive scheduling guidelines to design optimal schedulers for two-type heterogeneous multicore platforms, called Hetero-Fair. By tightly coupling the solutions of Hetero-Split and Hetero-Fair, we develop the first optimal two-type heterogeneous multicore scheduling algorithm, called Hetero-Wrap, that has the same complexity (O(n)) as in the identical multicore case. Finally, concerning a practical point of view, we derive the first bounds on the numbers of intra-and inter-cluster migrations under two-type heterogeneous multicore scheduling, respectively.","PeriodicalId":239882,"journal":{"name":"2015 IEEE Real-Time Systems Symposium","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128229897","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}

引用次数: 49

Qduino: A Multithreaded Arduino System for Embedded Computing Qduino:一个用于嵌入式计算的多线程Arduino系统

2015 IEEE Real-Time Systems Symposium Pub Date : 2015-12-01 DOI: 10.1109/RTSS.2015.32

Zhuoqun Cheng, Ye Li, R. West

{"title":"Qduino: A Multithreaded Arduino System for Embedded Computing","authors":"Zhuoqun Cheng, Ye Li, R. West","doi":"10.1109/RTSS.2015.32","DOIUrl":"https://doi.org/10.1109/RTSS.2015.32","url":null,"abstract":"Arduino is an open source platform that offers a clear and simple environment for physical computing. It is now widely used in modern robotics and Internet of Things (IoT) applications, due in part to its low-cost, ease of programming, and rapid prototyping capabilities. Sensors and actuators can easily be connected to the analog and digital I/O pins of an Arduino device, which features an on-board microcontroller programmed using the Arduino API. The increasing complexity of physical computing applications has now led to a series of Arduino-compatible devices with faster processors, increased flash storage, larger memories and more complicated I/O architectures. The Intel Galileo, for example, is designed to support the Arduino API on top of a Linux system, code-named Clanton. However, the standard API is restricted to the capabilities found on less powerful devices, lacking support for multithreaded programs, or specification of real-time requirements. In this paper, we present Qduino, a system developed for Arduino compatible boards. Qduino provides an extended Arduino API which, while backward-compatible with the original API, supports real-time multithreaded sketches and event handling. Experiments show the performance gains of Qduino compared to Clanton Linux.","PeriodicalId":239882,"journal":{"name":"2015 IEEE Real-Time Systems Symposium","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127996504","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

Uniprocessor Feasibility of Sporadic Tasks Remains coNP-Complete under Bounded Utilization 有限利用率下零星任务的单处理机可行性

2015 IEEE Real-Time Systems Symposium Pub Date : 2015-12-01 DOI: 10.1109/RTSS.2015.16

Pontus Ekberg, W. Yi

引用次数: 18

An Isolation Scheduling Model for Multicores 多核隔离调度模型

2015 IEEE Real-Time Systems Symposium Pub Date : 2015-12-01 DOI: 10.1109/RTSS.2015.21

Pengcheng Huang, G. Giannopoulou, R. Ahmed, D. Bartolini, L. Thiele

引用次数: 21

Quantifying the Exact Sub-optimality of Non-preemptive Scheduling 量化非抢占调度的精确次优性

2015 IEEE Real-Time Systems Symposium Pub Date : 2015-12-01 DOI: 10.1109/RTSS.2015.17

Robert I. Davis, Abhilash Thekkilakattil, Oliver Gettings, R. Dobrin, S. Punnekkat

{"title":"Quantifying the Exact Sub-optimality of Non-preemptive Scheduling","authors":"Robert I. Davis, Abhilash Thekkilakattil, Oliver Gettings, R. Dobrin, S. Punnekkat","doi":"10.1109/RTSS.2015.17","DOIUrl":"https://doi.org/10.1109/RTSS.2015.17","url":null,"abstract":"Fixed priority scheduling is used in many real-time systems, however, both preemptive and non-preemptive variants (FP-P and FP-NP) are known to be sub-optimal when compared to an optimal uniprocessor scheduling algorithm such as preemptive Earliest Deadline First (EDF-P). In this paper, we investigate the sub-optimality of fixed priority non-preemptive scheduling. Specifically, we derive the exact processor speed-up factor required to guarantee the feasibility under FP-NP (i.e. schedulablability assuming an optimal priority assignment) of any task set that is feasible under EDF-P. As a consequence of this work, we also derive a lower bound on the sub-optimality of non-preemptive EDF (EDF-NP), which since it matches a recently published upper bound gives the exact sub-optimality for EDF-NP. It is known that neither preemptive, nor non-preemptive fixed priority scheduling dominates the other, i.e., there are task sets that are feasible on a processor of unit speed under FP-P that are not feasible under FP-NP and vice-versa. Hence comparing these two algorithms, there are non-trivial speedup factors in both directions. We derive the exact speed-up factor required to guarantee the FP-NP feasibility of any FP-P feasible task set. Further, we derive upper and lower bounds on the speed-up factor required to guarantee FP-P feasibility of any FP-NP feasible task set. Empirical evidence suggests that the lower bound may be tight, and hence equate to the exact speed-up factor in this case.","PeriodicalId":239882,"journal":{"name":"2015 IEEE Real-Time Systems Symposium","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115338893","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

Data Acquisition for Real-Time Decision-Making under Freshness Constraints 基于新鲜度约束的实时决策数据采集

2015 IEEE Real-Time Systems Symposium Pub Date : 2015-12-01 DOI: 10.1109/RTSS.2015.25

Shaohan Hu, Shuochao Yao, Haiming Jin, Yiran Zhao, Yitao Hu, Xiaochen Liu, Nooreddin Naghibolhosseini, Shen Li, Akash Kapoor, William Dron, Lu Su, A. Bar-Noy, Pedro A. Szekely, R. Govindan, Reginald L. Hobbs, T. Abdelzaher

{"title":"Data Acquisition for Real-Time Decision-Making under Freshness Constraints","authors":"Shaohan Hu, Shuochao Yao, Haiming Jin, Yiran Zhao, Yitao Hu, Xiaochen Liu, Nooreddin Naghibolhosseini, Shen Li, Akash Kapoor, William Dron, Lu Su, A. Bar-Noy, Pedro A. Szekely, R. Govindan, Reginald L. Hobbs, T. Abdelzaher","doi":"10.1109/RTSS.2015.25","DOIUrl":"https://doi.org/10.1109/RTSS.2015.25","url":null,"abstract":"The paper describes a novel algorithm for timely sensor data retrieval in resource-poor environments under freshness constraints. Consider a civil unrest, national security, or disaster management scenario, where a dynamic situation evolves and a decision-maker must decide on a course of action in view of latest data. Since the situation changes, so is the best course of action. The scenario offers two interesting constraints. First, one should be able to successfully compute the course of action within some appropriate time window, which we call the decision deadline. Second, at the time the course of action is computed, the data it is based on must be fresh (i.e., within some corresponding validity interval). We call it the freshness constraint. These constraints create an interesting novel problem of timely data retrieval. We address this problem in resource-scarce environments, where network resource limitations require that data objects (e.g., pictures and other sensor measurements pertinent to the decision) generally remain at the sources. Hence, one must decide on (i) which objects to retrieve and (ii) in what order, such that the cost of deciding on a valid course of action is minimized while meeting data freshness and decision deadline constraints. Such an algorithm is reported in this paper. The algorithm is shown in simulation to reduce the cost of data retrieval compared to a host of baselines that consider time or resource constraints. It is applied in the context of minimizing cost of finding unobstructed routes between specified locations in a disaster zone by retrieving data on the health of individual route segments.","PeriodicalId":239882,"journal":{"name":"2015 IEEE Real-Time Systems Symposium","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114918613","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}

引用次数: 31

Schedulability Analysis under Graph Routing in WirelessHART Networks 无线shart网络图路由下的可调度性分析

2015 IEEE Real-Time Systems Symposium Pub Date : 2015-12-01 DOI: 10.1109/RTSS.2015.23

Abusayeed Saifullah, Dolvara Gunatilaka, P. Tiwari, M. Sha, Chenyang Lu, Bo Li, Chengjie Wu, Yixin Chen

{"title":"Schedulability Analysis under Graph Routing in WirelessHART Networks","authors":"Abusayeed Saifullah, Dolvara Gunatilaka, P. Tiwari, M. Sha, Chenyang Lu, Bo Li, Chengjie Wu, Yixin Chen","doi":"10.1109/RTSS.2015.23","DOIUrl":"https://doi.org/10.1109/RTSS.2015.23","url":null,"abstract":"Wireless sensor-actuator networks are gaining ground as the communication infrastructure for process monitoring and control. Industrial applications demand a high degree of reliability and real-time guarantees in communication. Because wireless communication is susceptible to transmission failures in industrial environments, industrial wireless standards such as WirelessHART adopt reliable graph routing to handle transmission failures through retransmissions and route diversity. While these mechanisms are critical for reliable communication, they introduce substantial challenges in analyzing the schedulability of real-time flows. This paper presents the first worst-case end-to-end delay analysis for periodic real-time flows under reliable graph routing. The proposed analysis can be used to quickly assess the schedulability of real-time flows with stringent requirements on both reliability and latency. We have evaluated our schedulability analysis against experimental results on a wireless testbed of 69 nodes as well as simulations. Both experimental results and simulations show that our delay bounds are safe and enable effective schedulability tests under reliable graph routing.","PeriodicalId":239882,"journal":{"name":"2015 IEEE Real-Time Systems Symposium","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129407211","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}

引用次数: 66

Inter-cell Channel Time-Slot Scheduling for Multichannel Multiradio Cellular Fieldbuses 多通道多无线蜂窝现场总线的小区间信道时隙调度

2015 IEEE Real-Time Systems Symposium Pub Date : 2015-12-01 DOI: 10.1109/RTSS.2015.29

Aiping Tan, Qixin Wang, Nan Guan, Qingxu Deng, X. Hu

{"title":"Inter-cell Channel Time-Slot Scheduling for Multichannel Multiradio Cellular Fieldbuses","authors":"Aiping Tan, Qixin Wang, Nan Guan, Qingxu Deng, X. Hu","doi":"10.1109/RTSS.2015.29","DOIUrl":"https://doi.org/10.1109/RTSS.2015.29","url":null,"abstract":"Recently there is a growing interest of incorporating cellular architecture (with wired base stations and last-hop wireless connections) into fieldbuses to support mobile real-time applications. A promising trend is that such cellular fieldbuses will go multichannel multiradio, due to the wide availability of cheap multichannel commercial-off-the-shelf (COTS) wireless nodes, and the rise of 4G and future cellular technologies. For multichannel multiradio cellular fieldbuses, per-flow real-time schedulability guarantee in the inter-cell level has not yet been well studied. Particularly, unlike 3G cellular networks, which use static FDMA/CDMA to isolate cells, the multichannel multiradio feature allows neighboring cells to use the same radio frequency channel at different time-slots, or the same time-slot at different radio frequency channels. How to carry out channel time-slot scheduling is therefore the focus of this paper. To address this issue, we propose a greedy scheduling algorithm, together with a polynomial time closed-form schedulability test. The relationship between the schedulability test result, greedy scheduling schedulability, and schedulability is explored. We prove the equivalence of the three for chained cellular fieldbus topology, a typical topology with broad applications. This also implies the optimality of greedy scheduling, and the sufficiency and necessity of the schedulability test in the context of chained topology. To demonstrate and validate these schedulability theories, we carry out a case study on a classic admission planning problem. The schedulability test not only serves as a planning constraint, but also guides us to propose an approximation algorithm to solve the NP-hard admission planning problem. Comparisons to exhaustive search corroborate the validity of our schedulability theories.","PeriodicalId":239882,"journal":{"name":"2015 IEEE Real-Time Systems Symposium","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125386719","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}

引用次数: 9

Periodically-Scheduled Controller Analysis Using Hybrid Systems Reachability and Continuization 基于混合系统可达性和连续性的周期调度控制器分析

2015 IEEE Real-Time Systems Symposium Pub Date : 2015-12-01 DOI: 10.1109/RTSS.2015.26

Stanley Bak, Taylor T. Johnson

{"title":"Periodically-Scheduled Controller Analysis Using Hybrid Systems Reachability and Continuization","authors":"Stanley Bak, Taylor T. Johnson","doi":"10.1109/RTSS.2015.26","DOIUrl":"https://doi.org/10.1109/RTSS.2015.26","url":null,"abstract":"Cyber-physical systems (CPS) consist of physical entities that obey dynamical laws and interact with software components. A typical CPS implementation includes a discrete controller, where software periodically samples physical state and produces actuation commands according to a real-time schedule. Such a hybrid system can be modeled formally as a hybrid automaton. However, reachability tools to verify specifications for hybrid automata do not perform well on such periodically-scheduled models. This is due to a combination of the large number of discrete jumps and the nondeterminism of the exact controller start time. In this paper, we demonstrate this problem and propose a solution, which is a validated abstraction mechanism where every behavior of the original sampled system is contained in the behaviors of a purely continuous system with an additive nondeterministic input. Reachability tools for hybrid automata can better handle such systems. We further improve the analysis by considering local analysis domains. We automate the proposed technique in the Hyst model transformation tool, and demonstrate its effectiveness in a case study analyzing the design of a yaw-damper for a jet aircraft.","PeriodicalId":239882,"journal":{"name":"2015 IEEE Real-Time Systems Symposium","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122199381","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