Graphics processing units (GPUs) are becoming increasingly important in today's platforms as their increased generality allows for them to be used as powerfill co-processors. In this paper;we explore possible appl...
详细信息
ISBN:
(纸本)9780769545028
Graphics processing units (GPUs) are becoming increasingly important in today's platforms as their increased generality allows for them to be used as powerfill co-processors. In this paper;we explore possible applications for GPUs in real-timesystems, discuss the limitations and constraints imposed by current GPU technology, and present a summary of our research addressing many such constraints.
In this paper, we study run-time reconfiguration problem for tolerating core failures on NoC manycore platforms with following three objectives: (1) maintaining the maximal timing similarity between real-timeembedded...
详细信息
ISBN:
(纸本)9780769550886
In this paper, we study run-time reconfiguration problem for tolerating core failures on NoC manycore platforms with following three objectives: (1) maintaining the maximal timing similarity between real-timeembedded application' timing properties before and after the system reconfiguration;(2) guaranteeing to meet real-timeembedded application's deadline requirements after system reconfiguration;and (3) minimizing the task migration time delay. Two approaches, i.e. mixed integer quadratic programming (MIQP) based approach and a heuristic largest influence core first (LICF) approach, are developed to derive a reconfiguration strategy that meets the three objectives. the MIQP approach is able to obtain the optimal solution and can be used at run-time if extra memory is available. For memory limited systems, the LICF approach can be used to obtain a solution in polynomial timethat is near optimal.
Hierarchical scheduling has recently been used to provide temporal isolation to embedded virtualised systems. Response time analysis is a common way to derive a schedulability test these systems. this paper points out...
详细信息
ISBN:
(纸本)9780769537870
Hierarchical scheduling has recently been used to provide temporal isolation to embedded virtualised systems. Response time analysis is a common way to derive a schedulability test these systems. this paper points out that response time analysis for hierarchical fixed-priority scheduling found in the literature is only exact for tasks of the highest priority domain. For the rest of the tasks is an upper bound. In our work, we provide the exact analysis and we compare it with previously published works.
this paper presents a partially-automated solution for the definition of test oracles for validating Simulink models. Since these models are widely used for the design of embeddedsystems, their thorough validation is...
详细信息
ISBN:
(纸本)9781479908516
this paper presents a partially-automated solution for the definition of test oracles for validating Simulink models. Since these models are widely used for the design of embeddedsystems, their thorough validation is key. Errors and misunderstandings in these models may preclude the correctness and reliability of the final system: a manual, human-intensive validation activity is not enough, and automated solutions are fundamental to improve the current state of the art. the paper also presents Apolom, a prototype oracle generator, and the results of two experiments.
this paper presents an efficient best-effort approach for simulation-based timing analysis of complex real-timesystems. the method can handle in principle any software design that can be simulated, and is based on co...
详细信息
ISBN:
(纸本)9780769537870
this paper presents an efficient best-effort approach for simulation-based timing analysis of complex real-timesystems. the method can handle in principle any software design that can be simulated, and is based on controlling simulation input using a simple yet novel hill-climbing algorithm. Unlike previous approaches, the new algorithm directly manipulates simulation parameters such as execution times, arrival jitter and input. An evaluation is presented using six different simulation models, and two other simulation methods as reference: Monte Carlo simulation and MABERA. the new method proposed in this paper was 4-11% more accurate while at the same time 42 times faster on average, than the reference methods.
When using electronic commercial components for developing embedded computers dedicated to hard real-timeapplications (aeronautics, space ...), protection against single event effects are required. An overview of suc...
详细信息
ISBN:
(纸本)0769524060
When using electronic commercial components for developing embedded computers dedicated to hard real-timeapplications (aeronautics, space ...), protection against single event effects are required. An overview of such protections to be implemented at architecture and system levels is provided, to reach the high safety/availability requirements of avionics and space domains.
In work on globally-scheduled soft real-time multiprocessor systems, analysis has been presented for dealing with self-suspensions, but this analysis can be pessimistic. In this paper, we present an approach that is d...
详细信息
ISBN:
(纸本)9780769541556
In work on globally-scheduled soft real-time multiprocessor systems, analysis has been presented for dealing with self-suspensions, but this analysis can be pessimistic. In this paper, we present an approach that is designed to improve the schedulability of such systems. In experimental results that are presented, the proposed approach signi cantly improved schedulability in most considered scenarios.
Processor partitioning and hierarchical scheduling have been widely used for composing hard real-timesystems on a shared hardware platform while preserving the timing requirements of the systems. Due to the safety cr...
详细信息
ISBN:
(纸本)9781479908509
Processor partitioning and hierarchical scheduling have been widely used for composing hard real-timesystems on a shared hardware platform while preserving the timing requirements of the systems. Due to the safety critical nature of hard real-timesystems, a conservative analysis is often used for deriving a sufficient partition size. Applying the exact same analysis for deriving the partition sizes for soft real-timesystems result in unnecessary processors overallocation and consequently waste of the CPU resource. In this paper, to address the problem of composing soft and hard real-timesystems on a resource constrained shared hardware, we present a multi-level adaptive hierarchical scheduling framework. In our framework, we adapt the processor partition sizes of soft real-timesystems according to their need at each time point by on-line monitoring their processor demand. Furthermore, we implement our adaptive framework in the Linux kernel and show the performance of our framework using a case study.
Model Driven Engineering provides facilities to tackle complexity in real-timesystems, from early requirements capture to validation & verification down to code generation. We note that models are built from a sy...
详细信息
ISBN:
(纸本)9780769537870
Model Driven Engineering provides facilities to tackle complexity in real-timesystems, from early requirements capture to validation & verification down to code generation. We note that models are built from a system perspective, and resources are allocated to meet communication, energy or scheduling constraints. Yet, it is seldom optimal. In this paper, we explore transformations applied at model-level that preserve schedulability of the system, yet reduce the overall resource consumption. We use A AD L as input formalism. By automating this process, we show how to transition from a system view to an implementation view, closer to actual hardware constraints.
Modern processors often provide cache locking capability which can be applied statically and dynamically to manage cache in a predictable manner. the selection of instructions to be locked in the instruction cache (I-...
详细信息
ISBN:
(纸本)9780769537870
Modern processors often provide cache locking capability which can be applied statically and dynamically to manage cache in a predictable manner. the selection of instructions to be locked in the instruction cache (I-Cache) has dramatic influence on the performance of multi-task real-timeembeddedsystems. this paper focuses on using cache locking techniques on a shared I-Cache in a real-timeembedded system with multi-tasks to minimize its worst-case utilization (WCU) which is one of the most important criteria for designing real-timeembeddedsystems. We analyze the static and dynamic strategies to perform I-Cache locking and propose different algorithms which utilize the foreknowing information of the real-timeembeddedapplications. Experiments show that the proposed algorithms can reduce WCU further compared to previous techniques. Design suggestions on which strategy should be utilized under different situations are also induced from the experimental results.
暂无评论