In this paper we introduce exact and non-exact real-time waits in reactive Globally Asynchronous Locally Synchronous (GALS) programming languages and synchronous languages as their subset. the language constructs that...
详细信息
ISBN:
(纸本)9781479939541
In this paper we introduce exact and non-exact real-time waits in reactive Globally Asynchronous Locally Synchronous (GALS) programming languages and synchronous languages as their subset. the language constructs that allow use of real-time waits are illustrated on the SystemJ GALS language. they allow system designers to explicitly use, at the specification level, not only logical time but also the real-time in order to control program execution. the introduced concepts utilize execution platforms that allow finding best and worst reaction time of a GALS or synchronous program.
Energy-efficient designs have played import roles for hardware and software implementations for a decade. Withthe advanced technology of VLSI circuit designs, energy-efficiency can be achieved by adopting the dynamic...
详细信息
ISBN:
(纸本)9780769529752
Energy-efficient designs have played import roles for hardware and software implementations for a decade. Withthe advanced technology of VLSI circuit designs, energy-efficiency can be achieved by adopting the dynamic voltage scaling (DVS) technique. In this paper we survey the studies for energy-efficient scheduling in real-timesystems on DVS platforms to cover boththeoretical and practical issues.
timeliness is an important feature for many embeddedsystems. Although soft real-timeembeddedsystems can tolerate and allow certain deadline misses, it is still important to quantify them to justify whether the cons...
详细信息
ISBN:
(纸本)9781538677599
timeliness is an important feature for many embeddedsystems. Although soft real-timeembeddedsystems can tolerate and allow certain deadline misses, it is still important to quantify them to justify whether the considered systems are acceptable. In this paper, we provide a way to safely over-approximate the expected deadline miss rate for a specific sporadic real-time task under fixed-priority preemptive scheduling in uniprocessor systems. Our approach is compatible withthe existing results in the literature that calculate the probability of deadline misses either based on the convolution-based approaches or analytically. We demonstrate our approach by considering randomly generated task sets with an execution behavior that simulates jobs that are subjected to soft errors incurred by hardware transient faults under a given fault rate. To empirically gather the deadline miss rates, we implemented an event-based simulator with a fault-injection module and release the scripts. With extensive simulations under different fault rates, we evaluate the efficiency and the pessimism of our approach. the evaluation results show that our approach is effective to derive an upper bound of the expected deadline miss rate and efficient with respect to the required computation time.
the modeling approach is not used to its full potential in maintenance of legacy systems. Often, models do not even exist. the main reasons being that the economic implications and practical hurdles in manually mainta...
详细信息
ISBN:
(纸本)0769526764
the modeling approach is not used to its full potential in maintenance of legacy systems. Often, models do not even exist. the main reasons being that the economic implications and practical hurdles in manually maintaining models of in-use legacy systems are considered too high by the industry. In this paper, we present a method for automated validation of models automatically generated from recordings of executing real-timeembeddedsystems. this forms an essential constituent of a unified process for the automatic modeling of legacy software. We also present a study in which we automatically model a state-of-practice industrial robot control system, the results of which are clearly positive indicators of the viability of our approach.
In this paper we address the problem of dynamic memory management in real-time Java embeddedsystems. Our work aims at suppressing the need for garbage collection in order to avoid unpredictable pause times. For that ...
详细信息
ISBN:
(纸本)9780769529752
In this paper we address the problem of dynamic memory management in real-time Java embeddedsystems. Our work aims at suppressing the need for garbage collection in order to avoid unpredictable pause times. For that we use a simple static analysis algorithm coupled with region-based memory management as presented in [151] To overcome the well-known limitations of region inference, we propose in this paper to involve the developer in the analysis process by providing feedback on programming constructs likely to produce memory leaks. Experiments show that for most programming patterns, our system behaves as efficiently as a garbage collector in terms of memory consumption. Our analysis tool is furthermore able to provide useful feedback to the programmer to pinpoint problematic constructs.
this paper extends U-Link Scheduling to increase the average execution efficiency of the system. We first define the execution efficiency. then we propose a new algorithm that establishes the co-scheduled sets where t...
详细信息
ISBN:
(纸本)0769526764
this paper extends U-Link Scheduling to increase the average execution efficiency of the system. We first define the execution efficiency. then we propose a new algorithm that establishes the co-scheduled sets where the execution efficiency can be increased Also we present the static estimation of the execution time and provide the schedulability analysis for the extended U-Link Scheduling. In the experiments, we evaluate the advancement of the extended U-Link Scheduling from the viewpoint of the execution efficiency and real-time processing.
Memory management has become an important part in developing real-time and embeddedapplications. the conventional dynamic storage allocation (DSA) Algorithms have been considered inappropriate for real-time applicati...
详细信息
ISBN:
(纸本)9781424408665
Memory management has become an important part in developing real-time and embeddedapplications. the conventional dynamic storage allocation (DSA) Algorithms have been considered inappropriate for real-timeapplications due to the unbounded response time and fragmentation problem. there are some new allocators designed to meet the requirements nowadays. Two-Level Segregated Fit memory allocator (TLSF) was proposed and widely used in the real-time Operating systems (RTOS) like RTLinux. It hits a bounded response time and quite good performance. However, there are still some problems withthis algorithm and it could. be improved. Here we discuss some improvements of the TLSF algorithm. Experiments show it has low fragmentation and faster response time.
Characterizing computational demand of Cyber-Physical systems (CPS) is critical for guaranteeing that multiple hard real-time tasks may be scheduled on shared resources without missing deadlines. In a CPS involving re...
详细信息
ISBN:
(纸本)9781665441889
Characterizing computational demand of Cyber-Physical systems (CPS) is critical for guaranteeing that multiple hard real-time tasks may be scheduled on shared resources without missing deadlines. In a CPS involving repetition such as industrial automation systems found in chemical process control or robotic manufacturing, sensors and actuators used as part of the industrial process may be conditionally enabled (and disabled) as a sequence of repeated steps is executed. In robotic manufacturing, for example, these steps may be the movement of a robotic arm through some trajectories followed by activation of end-effector sensors and actuators at the end of each completed motion. the conditional enabling of sensors and actuators produces a sequence of Monotonically Ascending Execution times (MAE) with lower WCET when the sensors are disabled and higher WCET when enabled. Since these systems may have several predefined steps to follow before repeating the entire sequence each unique step may result in several consecutive sequences of MAE. the repetition of these unique sequences of MAE result in a repeating WCET sequence. In the absence of an efficient demand characterization technique for repeating WCET sequences composed of subsequences with monotonically increasing execution time, this work proposes a new task model to describe the behavior of real-world systems which generate large repeating WCET sequences with subsequences of monotonically increasing execution times. In comparison to the most applicable current model, the Generalized Multiframe model (GMF), an empirically and theoretically faster method for characterizing the demand is provided. the demand characterization algorithm is evaluated through a case study of a robotic arm and simulation of 10,000 randomly generated tasks where, on average, the proposed approach is 231 and 179 times faster than the state-of-the-art in the case study and simulation respectively.
Autonomous cyber-physical systems (CPS) are susceptible to non-invasive physical attacks such as sensor spoofing attacks that are beyond the classical cybersecurity domain. these attacks have motivated numerous resear...
详细信息
ISBN:
(纸本)9781665441889
Autonomous cyber-physical systems (CPS) are susceptible to non-invasive physical attacks such as sensor spoofing attacks that are beyond the classical cybersecurity domain. these attacks have motivated numerous research efforts on attack detection, but little attention on what to do after detecting an attack. the importance of attack recovery is emphasized by the need to mitigate the attack's impact on a system and restore it to continue functioning. there are only a few works addressing attack recovery, but they all rely on prior knowledge of system dynamics. To overcome this limitation, we propose Recovery-by-Learning, a data-driven attack recovery framework that restores CPS from sensor attacks. the framework leverages natural redundancy among heterogeneous sensors and historical data for attack recovery. Specially, the framework consists of two major components: state predictor and data checkpointer. First, the predictor is triggered to estimate systems states after the detection of an attack. We propose a deep learning-based prediction model that exploits the temporal correlation among heterogeneous sensors. Second, the checkpointer executes when no attack is detected. We propose a double sliding window based checkpointing protocol to remove compromised data and keep trustful data as input to the state predictor. third, we implement and evaluate the effectiveness of our framework using a realistic data set and a ground vehicle simulator. the results show that our method restores a system to continue functioning in presence of sensor attacks.
real-timeembeddedsystems are increasingly being networked. In distributed real-timeembeddedapplications, e.g., electric grid management and command and control applications, it is required to not only meet real-ti...
详细信息
ISBN:
(纸本)0769526764
real-timeembeddedsystems are increasingly being networked. In distributed real-timeembeddedapplications, e.g., electric grid management and command and control applications, it is required to not only meet real-time constraints but also support the data confidentiality, integrity, and authenticity. Unfortunately, in general, cryptographic functions are computationally expensive, possibly causing deadline misses in real-timeembeddedsystems with limited resources. As a basis for cost-effective security support in real-timeembeddedsystems, we define a quantitative notion of Strength of Defense (SoD). Based on the SoD concept, we propose a novel adaptive security policy in which the SoD can be degraded by decreasing the cryptographic key length for certain tasks, if necessary, to improve the success ratio under overload conditions. Our approach is lightweight. the time complexity of our approach is linear and its amortized version has the constant overhead per Sol) adaptation period. Moreover, our approach supports desirable security features requiring an attacker to do extra work to find the cryptographic key. In the performance evaluation, we show that our approach can considerably improve the success ratio due to controlled Sol) degradation under overload.
暂无评论