2015 IEEE Real-Time Systems Symposium最新文献

{"title":"Distributed Deadline and Renewable Aware Electric Vehicle Demand Response in the Smart Grid","authors":"Fanxin Kong, Xue Liu","doi":"10.1109/RTSS.2015.10","DOIUrl":"https://doi.org/10.1109/RTSS.2015.10","url":null,"abstract":"Demand response is an important feature and functionality of the future smart grid. Electric vehicles are recognized as a particularly promising resource for demand response given their high charging demand and flexibility in demand management. Recently, researchers begun to apply market-based solutions to electric vehicle demand response. A clear vision, however, remains elusive because existing works overlook three key issues. (i) The hierarchy among electric vehicles (EVs), charging stations, and electric power companies (EPCs). Previous works assume direct interaction between EVs and EPCs and thus confine to single-level market designs. The designed mechanisms are inapplicable here due to ignoring the role of charging stations in the hierarchy. (ii) Temporal aspects of charging loads. Solely focusing on economic aspects makes significant demand reduction, but electric vehicles would end up with little allocated power due to overlooking their temporal constraints. (iii) Renewable generation co-located with charging stations. Market mechanisms that overlook the uncertainty of renewable would cause much inefficiency in terms of both the economic and temporal aspects. To address these issues, we study a new demand response scheme, i.e, hierarchical demand response for electric vehicles via charging stations. We propose that two-level marketing is suitable to this hierarchical scheme, and design a distributed market mechanism that is compatible with both the economic and temporal aspects of electric vehicle demand response. The market mechanism has a hierarchical decision-making structure by which the charging station leads the market and electric vehicles follow and respond to its actions. An appealing feature of the mechanism is the provable convergence to a unique equilibrium solution. At the equilibrium, neither the charging station or electric vehicles can improve their individual economic and/or temporal performance by changing their own strategies. Furthermore, we present a stochastic optimization based algorithm to optimize economic performance for the charging station at the equilibrium, given the predictions of the co-located renewable generation. The algorithm has provable robust performance guarantee in terms of the variance of the prediction errors. We finally evaluate the designed mechanism via detailed simulations. The results show the efficacy and validate the theoretical analysis for the mechanism.","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":"134380859","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}

{"title":"Platform-Specific Code Generation from Platform-Independent Timed Models","authors":"Baekgyu Kim, Lu Feng, O. Sokolsky, Insup Lee","doi":"10.1109/RTSS.2015.15","DOIUrl":"https://doi.org/10.1109/RTSS.2015.15","url":null,"abstract":"Many safety-critical real-time embedded systems need to meet stringent timing constraints such as preserving delay bounds between input and output events. In model-based development, a system is often implemented by using a code generator to automatically generate source code from system models, and integrating the generated source code with a platform. It is challenging to guarantee that the implemented systems preserve required timing constraints, because the timed behavior of the source code and the platform is closely intertwined. In this paper, we address this challenge by proposing a model transformation approach for the code generation. Our approach compensates the platform-processing delays by adjusting the timing parameters in system models, based on an Integer Linear Programming problem formulation. We demonstrate the usefulness of our approach via a case study of infusion pump systems. Experimental results show that the code generated using our approach can better preserve the timing constraints.","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":"125273080","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}

{"title":"Modeling and Real-Time Scheduling of Large-Scale Batteries for Maximizing Performance","authors":"Eugene Kim, Jinkyu Lee, K. Shin","doi":"10.1109/RTSS.2015.11","DOIUrl":"https://doi.org/10.1109/RTSS.2015.11","url":null,"abstract":"Modern electric vehicles are equipped with an advanced battery management system, responsible for providing the necessary power efficiently from batteries to electric motors while maintaining the batteries within an operational condition. Because discharge-rate and temperature of batteries affect their health and efficiency significantly, batteries are managed to mitigate their discharge and thermal stresses. In this paper, we develop a real-time, efficient integrated management system for discharge-rate and temperature of batteries. To achieve this objective, we first construct a prognosis system predicting the likely states of batteries' capacity and capability. Based on prognostic estimates of the impact of temperature and discharge-rate on the performance, we solve an optimization problem to search for efficient discharging and cooling scheduling. Our experimentation and simulation demonstrate that the proposed management enhances system performance up to 85.3%.","PeriodicalId":239882,"journal":{"name":"2015 IEEE Real-Time Systems Symposium","volume":"35 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":"115407015","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}

{"title":"A Quadratic-Time Response Time Upper Bound with a Tightness Property","authors":"Enrico Bini, A. Parri, Giacomo Dossena","doi":"10.1109/RTSS.2015.9","DOIUrl":"https://doi.org/10.1109/RTSS.2015.9","url":null,"abstract":"The response time analysis (RTA) is one of the fundamental tools used to guarantee the schedulability of sets of real-time tasks scheduled by Fixed Priorities. Also, several analysis methods inspired by RTA have been successfully developed to address more sophisticated execution platforms (distributed systems, multiprocessor) and application models (DAGs). The major issue with RTA is its time complexity, which is NP-hard. Such a complexity shows up when the task set has high utilization and RTA needs to check all jobs until the first idle instant. In this paper, we propose a continuous upper bound to the response time with quadratic time complexity in the number of tasks. Such an upper bound is demonstrated to be tighter than previously proposed ones with linear time complexity. In addition, with two tasks only, we prove that the proposed bound is the tightest continuous function upper bounding the exact response time of sets of tasks with full utilization. Whether or not this property holds with more than two tasks is still an open problem.","PeriodicalId":239882,"journal":{"name":"2015 IEEE Real-Time Systems Symposium","volume":"30 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":"127170488","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}

{"title":"Analyzing Real Time Linear Control Systems Using Software Verification","authors":"Parasara Sridhar Duggirala, Mahesh Viswanathan","doi":"10.1109/RTSS.2015.28","DOIUrl":"https://doi.org/10.1109/RTSS.2015.28","url":null,"abstract":"Deployed embedded software interacts with sensors and actuators to control a physical environment. While the evolution of the control system is specified by Ordinary Differential Equations (ODEs), the embedded software periodically senses the state of the system, performs computation over the inputs, and initiates the actuators based on the result of computation. In this paper, we present a bounded time safety verification technique for periodically actuated linear control systems. The model considered in this paper takes into account that the control tasks are executed on a real time operating system and hence the task, in some instances misses the real time deadlines. Using matrix exponentiation, and symbolic evaluation of inputs, we reduce the verification problem of such systems into software verification with computation over reals. We compare different techniques for verifying such software, highlight the merits of each of the approaches, and present our experimental results.","PeriodicalId":239882,"journal":{"name":"2015 IEEE Real-Time Systems Symposium","volume":"119 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":"126884226","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}

{"title":"Using Entropy as a Parameter to Schedule Real-Time Tasks","authors":"C. Rincón C., A. Cheng","doi":"10.1109/RTSS.2015.44","DOIUrl":"https://doi.org/10.1109/RTSS.2015.44","url":null,"abstract":"The purpose of this paper is to present the mathematical background for using entropy in real-time scheduling as well as the relationship between entropy and utilization. We present a new scheduling algorithm based on entropy to schedule tasks in real-time systems. The goal is to minimize the uncertainty of the scheduling problem by executing the task with the highest entropy first without missing any deadline. The uncertainty measurement is based on the probability of the execution of a task during the hyper-period. This study aims to present entropy as a new parameter that can be used by researchers in different real-time systems fields.","PeriodicalId":239882,"journal":{"name":"2015 IEEE Real-Time Systems Symposium","volume":"21 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":"127648121","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}

{"title":"Dynamic Control for Mixed-Critical Networks-on-Chip","authors":"Adam Kostrzewa, Selma Saidi, R. Ernst","doi":"10.1109/RTSS.2015.37","DOIUrl":"https://doi.org/10.1109/RTSS.2015.37","url":null,"abstract":"Networks-on-Chip (NoCs) for future real-time systems must provide service guarantees for applications with different levels of criticality. In this work, we propose an efficient mechanism for supporting mixed-criticality which combines the global, work-conserving scheduling for the end to end guarantees with the local arbitration in routers. We introduce a dynamic control layer with a central Resource Manager (RM) synchronizing transmissions with a dedicated protocol. The proposed mechanism allows to improve over existing solutions through reducing hardware overhead compared to non-blocking routers with rate control as well as temporal overhead compared to Time-Division Multiplexing (TDM). By using formal analysis, we show that RMs provide efficient service guarantees to all synchronized applications. We validate experimentally, using benchmarks, these guarantees along with the performance of the mechanism and induced overhead.","PeriodicalId":239882,"journal":{"name":"2015 IEEE Real-Time Systems Symposium","volume":"174 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":"122319738","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}

{"title":"Deferred Start: A Non-Work-Conserving Model for P-FRP Fixed Priority Task Scheduling","authors":"Xingliang Zou, A. Cheng, Yu Jiang","doi":"10.1109/RTSS.2015.42","DOIUrl":"https://doi.org/10.1109/RTSS.2015.42","url":null,"abstract":"In real-time systems, FRP (Functional Reactive Programming) is playing and potentially going to play a more important role. Priority-based (preemptive) FRP (P-FRP), a variant of FRP with more real-time characteristics, demands more research in its scheduling and timing analysis. Its abort-and-restart nature indicates that reducing preemptions can be critical for improving system performance. In this paper, we present a non-work conserving scheduling model, Deferred Start, to reduce certain preemptions. Experiments show the improvement on schedulability and task response time.","PeriodicalId":239882,"journal":{"name":"2015 IEEE Real-Time Systems Symposium","volume":"50 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":"131820800","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}

{"title":"Static Probabilistic Timing Analysis for Multi-path Programs","authors":"Benjamin Lesage, D. Griffin, S. Altmeyer, Robert I. Davis","doi":"10.1109/RTSS.2015.41","DOIUrl":"https://doi.org/10.1109/RTSS.2015.41","url":null,"abstract":"This paper introduces an effective Static Probabilistic Timing Analysis (SPTA) for multi-path programs. The analysis estimates the temporal contribution of an evict-on-miss, random replacement cache to the probabilistic Worst-Case Execution Time (pWCET) distribution of multi-path programs. The analysis uses a conservative join function that provides a proper overapproximation of the possible cache contents and the pWCET distribution on path convergence, irrespective of the actual path followed during execution. Simple program transformations are introduced that reduce the impact of path indeterminism while ensuring sound pWCET estimates. Evaluation shows that the proposed method is efficient at capturing locality in the cache, and substantially outperforms the only prior approach to SPTA for multi-path programs based on path merging. The evaluation results show incomparability with analysis for an equivalent deterministic system using an LRU cache.","PeriodicalId":239882,"journal":{"name":"2015 IEEE Real-Time Systems Symposium","volume":"66 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132330973","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}

{"title":"MC-Fluid: Simplified and Optimally Quantified","authors":"Sanjoy Baruah, A. Easwaran, Zhishan Guo","doi":"10.1109/RTSS.2015.38","DOIUrl":"https://doi.org/10.1109/RTSS.2015.38","url":null,"abstract":"The fluid scheduling model allows for schedules in which an individual task may be assigned a fraction of a processor at each time instant. These assignments are subject to the constraints that no fraction exceeds one and the sum of all the assigned fractions do not exceed the sum of the computing capacities of all the processors at any instant. An algorithm, MC-Fluid, has recently been proposed for scheduling systems of mixed-criticality implicit-deadline sporadic tasks under the fluid scheduling model. MC-Fluid has been shown to have a speedup bound no worse than (1 + √5)/2 or ≈ 1.618 for scheduling dual-criticality systems. We derive here a simplified variant of MC-Fluid called MCF, that has run-time linear in the number of tasks. We prove that this simplified variant has a speedup bound no worse than 4/3 for dual-criticality systems, and show that this implies that MC-Fluid, too, has a speedup bound no worse than 4/3. We know from prior results in uniprocessor mixed-criticality scheduling that no algorithm may have a speedup bound smaller than 4/3, allowing us to conclude that MCF and MC-Fluid are in fact speedup-optimal for dual-criticality scheduling.","PeriodicalId":239882,"journal":{"name":"2015 IEEE Real-Time Systems Symposium","volume":"92 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":"121633494","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}