Spelling suggestions: "subject:"had realtime"" "subject:"had realtime""
1 |
Worst Case Analysis of DRAM Latency in Hard Real Time SystemsWu, Zheng Pei 17 December 2013 (has links)
As multi-core systems are becoming more popular in real time embedded systems, strict timing requirements for accessing shared resources must be met. In particular, a detailed latency analysis for Double Data Rate Dynamic RAM (DDR DRAM) is highly desirable. Several researchers have proposed predictable memory controllers to provide guaranteed memory access latency. However, the performance of such controllers sharply decreases as DDR devices become faster and the width of memory buses is increased. Therefore, a novel and composable approach is proposed that provides improved latency bounds compared to existing works by explicitly modeling the DRAM state. In particular, this new approach scales better with increasing number of cores and memory speed. Benchmark evaluation results show up to a 45% improvement in the worst case task execution time compared to a competing predictable memory controller for a system with 16 cores.
|
2 |
Parallelizing Trusted Execution Environments for Multicore Hard Real-Time SystemsMishra, Tanmaya 05 June 2019 (has links)
Real-Time systems are defined not only by their logical correctness but also timeliness. Modern real-time systems, such as those controlling industrial plants or the flight controller on UAVs, are no longer isolated. The same computing resources are shared with a variety of other systems and software. Further, these systems are increasingly being connected and made available over the internet with the rise of Internet of Things and the need for automation. Many real-time systems contain sensitive code and data, which not only need to be kept confidential but also need protection against unauthorized access and modification. With the cheap availability of hardware supported Trusted Execution Environments (TEE) in modern day microprocessors, securing sensitive information has become easier and more robust. However, when applied to real-time systems, the overheads of using TEEs make scheduling untenable. However, this issue can be mitigated by judiciously utilizing TEEs and capturing TEE operation peculiarities to create better scheduling policies. This thesis provides a new task model and scheduling approach, Split-TEE task model and a scheduling approach ST-EDF. It also presents simulation results for 2 previously proposed approaches to scheduling TEEs, T-EDF and CT-RM. / Master of Science / Real-Time systems are computing systems that not only maintain the traditional purpose of any computer, i.e, to be logically correct, but also timeliness, i.e, guaranteeing an output in a given amount of time. While, traditionally, real-time systems were isolated to reduce interference which could affect the timeliness, modern real-time systems are being increasingly connected to the internet. Many real-time systems, especially those used for critical applications like industrial control or military equipment, contain sensitive code or data that must not be divulged to a third party or open to modification. In such cases, it is necessary to use methods to safeguard this information, regardless of the extra processing time/resource consumption (overheads) that it may add to the system. Modern hardware support Trusted Execution Environments (TEEs), a cheap, easy and robust mechanism to secure arbitrary pieces of code and data. To effectively use TEEs in a real-time system, the scheduling policy which decides which task to run at a given time instant, must be made aware of TEEs and must be modified to take as much advantage of TEE execution while mitigating the effect of its overheads on the timeliness guarantees of the system. This thesis presents an approach to schedule TEE augmented code and simulation results of two previously proposed approaches.
|
3 |
A cross-layer middleware architecture for time and safety critical applications in MANETsPease, Sarogini G. January 2013 (has links)
Mobile Ad hoc Networks (MANETs) can be deployed instantaneously and adaptively, making them highly suitable to military, medical and disaster-response scenarios. Using real-time applications for provision of instantaneous and dependable communications, media streaming, and device control in these scenarios is a growing research field. Realising timing requirements in packet delivery is essential to safety-critical real-time applications that are both delay- and loss-sensitive. Safety of these applications is compromised by packet loss, both on the network and by the applications themselves that will drop packets exceeding delay bounds. However, the provision of this required Quality of Service (QoS) must overcome issues relating to the lack of reliable existing infrastructure, conservation of safety-certified functionality. It must also overcome issues relating to the layer-2 dynamics with causal factors including hidden transmitters and fading channels. This thesis proposes that bounded maximum delay and safety-critical application support can be achieved by using cross-layer middleware. Such an approach benefits from the use of established protocols without requiring modifications to safety-certified ones. This research proposes ROAM: a novel, adaptive and scalable cross-layer Real-time Optimising Ad hoc Middleware framework for the provision and maintenance of performance guarantees in self-configuring MANETs. The ROAM framework is designed to be scalable to new optimisers and MANET protocols and requires no modifications of protocol functionality. Four original contributions are proposed: (1) ROAM, a middleware entity abstracts information from the protocol stack using application programming interfaces (APIs) and that implements optimisers to monitor and autonomously tune conditions at protocol layers in response to dynamic network conditions. The cross-layer approach is MANET protocol generic, using minimal imposition on the protocol stack, without protocol modification requirements. (2) A horizontal handoff optimiser that responds to time-varying link quality to ensure optimal and most robust channel usage. (3) A distributed contention reduction optimiser that reduces channel contention and related delay, in response to detection of the presence of a hidden transmitter. (4) A feasibility evaluation of the ROAM architecture to bound maximum delay and jitter in a comprehensive range of ns2-MIRACLE simulation scenarios that demonstrate independence from the key causes of network dynamics: application setting and MANET configuration; including mobility or topology. Experimental results show that ROAM can constrain end-to-end delay, jitter and packet loss, to support real-time applications with critical timing requirements.
|
4 |
Reliability for Hard Real-time Communication in Packet-switched NetworksGanjalizadeh, Milad January 2014 (has links)
Nowadays, different companies use Ethernet for different industrial applications. Industrial Ethernet has some specific requirements due to its specific applications and environmental conditions which is the reason that makes it different than corporate LANs. Real-time guarantees, which require precise synchronization between all communication devices, as well as reliability are the keys in performance evaluation of different methods [1]. High bandwidth, high availability, reduced cost, support for open infrastructure as well as deterministic architecture make packet-switched networks suitable for a variety of different industrial distributed hard real-time applications. Although research on guaranteeing timing requirements in packet-switched networks has been done, communication reliability is still an open problem for hard real-time applications. In this thesis report, a framework for enhancing the reliability in multihop packet-switched networks is presented. Moreover, a novel admission control mechanism using a real-time analysis is suggested to provide deadline guarantees for hard real-time traffic. A generic and flexible simulator has been implemented for the purpose of this research study to measure different defined performance metrics. This simulator can also be used for future research due to its flexibility. The performance evaluation of the proposed solution shows a possible enhancement of the message error rate by several orders of magnitude, while the decrease in network utilization stays at a reasonable level.
|
5 |
ARCHITECTURE-AWARE HARD-REAL-TIME SCHEDULING ON MULTI-CORE ARCHITECTURESShekhar, Mayank 01 December 2014 (has links)
The increasing dependency of man on machines have led to increase computational load on systems. The increasing computational load can be handled to some extent by scaling up processor frequencies. However, this approach has hit a frequency and power wall and the increasing awareness towards green computing discourages this solution. This leads us to use multi-core architectures. Due to the same reason, real-time systems are also migrating from single-core towards multi-core systems. While multi-core systems provide scalable high computational power, they also expose real-time systems to several challenges. Most of these challenges hamper the key property of real-time systems, i.e., predictability. In this work, we address some challenges imposed by multi-core architectures on real-time systems. We propose and evaluate several scheduling algorithms and demonstrate improved predictability and performance over existing methods. A unifying them in all our algorithms is that we explicitly consider the effects of architectural factors on the scheduling and schedulablity of real-time programs. As a case study, we use Tilera's TilePro64 platform as an example multi-core platform and implement some of our algorithms on this platform. Through this case study, we derive several useful conclusions regarding performance, predictability and practical overheads on a multi-core architecture.
|
6 |
Software Synthesis for Energy-Constrained Hard Real-Time Embedded SystemsTAVARES, Eduardo Antônio Guimarães 31 January 2009 (has links)
Made available in DSpace on 2014-06-12T15:49:47Z (GMT). No. of bitstreams: 1
license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5)
Previous issue date: 2009 / A grande expansão do mercado de dispositivos digitais tem forçado empresas desenvolvedoras
de sistemas embarcados em lidar com diversos desafios para prover sistemas
complexos nesse nicho de mercado. Um dos desafios prominentes está relacionado ao
consumo de energia, principalmente, devido aos seguintes fatores: (i) mobilidade; (ii)
problemas ambientais; e (iii) o custo da energia. Como consequência, consideráveis esforços
de pesquisa têm sido dedicados para a criação de técnicas voltadas para aumentar
a economia de energia.
Na última década, diversas técnicas foram desenvolvidas para reduzir o consumo de
energia em sistemas embarcados. Muitos métodos lidam com gerenciamento dinâmico de
energia (DPM), como, por exemplo, dynamic voltage scaling (DVS), cooperativamente
com sistemas operacionais especializados, a fim de controlar o consumo de energia durante
a execução do sistema. Entretanto, apesar da disponibilidade de muitos métodos de
redução de consumo de energia, diversas questões estão em aberto, principalmente, no
contexto de sistemas de tempo real crítico.
Este trabalho propõe um método de síntese de software, o qual leva em consideração
relação entre tarefas, overheads, restrições temporais e de energia. O método é composto
por diversas atividades, as quais incluem: (i) medição; (ii) especificação; (iii) modelagem
formal; (vi) escalonamento; e (v) geração de código. O método também é centrado no
formalismo redes de Petri, o qual define uma base para geração precisa de escalas em
tempo de projeto, adotando DVS para reduzir o consumo de energia. A partir de uma
escala viável, um código customizado é gerado satisfazendo as restrições especificadas,
e, dessa forma, garantindo previsibilidade em tempo de execução. Para lidar com a natureza
estática das escalas geradas em tempo de projeto, um escalonador simples em
tempo de execução é também proposto para melhorar o consumo de energia durante a
execução do sistema. Diversos experimentos foram conduzidos, os quais demonstram a
viabilidade da abordagem proposta para satisfazer restrições críticas de tempo e energia.
Adicionalmente, um conjunto integrado de ferramentas foram desenvolvidas para
automatizar algumas atividades do método de síntese de software proposto
|
7 |
Scheduling hard real-time tasks in heterogeneous multiprocessor platforms subject to energy and temperature constraints / Agendando tarefas duras em tempo real em plataformas de multiprocessadores heterogêneas sujeitas a restrições de energia e temperaturaValentin, Eduardo Bezerra, 92-36710870 29 September 2017 (has links)
Submitted by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2018-02-08T12:48:35Z
No. of bitstreams: 2
license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Tese_Eduardo Bezerra Valetim.pdf: 1753904 bytes, checksum: b47b056ce4f5f67a30051e12c578323a (MD5) / Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2018-02-08T12:49:13Z (GMT) No. of bitstreams: 2
license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Tese_Eduardo Bezerra Valetim.pdf: 1753904 bytes, checksum: b47b056ce4f5f67a30051e12c578323a (MD5) / Made available in DSpace on 2018-02-08T12:49:13Z (GMT). No. of bitstreams: 2
license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Tese_Eduardo Bezerra Valetim.pdf: 1753904 bytes, checksum: b47b056ce4f5f67a30051e12c578323a (MD5)
Previous issue date: 2017-09-29 / The power wall is a barrier to improvement in the processor design process due to the
power consumption of components. The production of energy optimum systems demands
knowledge of different disciplines. The usage of heterogeneous multicore platforms is appealing
for recent applications, e.g., hard real-time systems. The motivation is the potential
reduced energy consumption offered by such platforms. Hard real-time systems are
present in life critical environments. Reducing the energy consumption on such systems
is an onerous process. Scheduling becomes particularly challenging to improve system
utilization and minimize system energy consumption and peak temperature on such platforms,
specially subject to hard real-time constraints.
Therefore, we propose a study to effectively answer the pertinent research question: “How
to offer users timing correctness and guarantees of hard real-time systems executed on heterogeneous
multicore systems with energy and temperature constraints?”. Finding optimal
solutions for such question has still several open research questions.
The main aim of this thesis is to propose an energy optimization method for hard realtime
system on heterogeneous multicore platform demonstrating that it is possible to timely
compute timing correctness and guarantees using a sufficient and necessary condition; accounting
for energy, temperature, preemption, precedence, shared resources constraints,
and architectural interference. The proposal is a two fold approach. First, we investigate
the process of finding the optimal task to core and frequency to task processes by means
of applying exact schedulability tests for heterogeneous multicore platforms. Second, the
outcome of the optimization analysis shall be used as reference to the on-line scheduler.
We believe that we have achieved the main objective of this research by combining: (a)
schedulability analysis from hard real-time systems, (b) representative mathematical formulations,
based on integer linear programming, covering modern processors technological
characteristics and using a classical combinatorial mathematical formulation (Multilevel
Generalized Assignment Problem), and (c) robust exact implicit enumeration algorithmic
strategies from combinatorial optimization, such as branch-and-cut and branch-and-price.
The systematic literature review in the research subject reveals that the field has open
questions to be answered. For instance, to the knowledge of the author only five works
in the state-of-the-art literature deal with the problem by providing optimal solutions.
Typically, the existing approaches focus on either heuristics or approximation algorithms.
Also, only one work has a proposal to evaluate the schedulability in this scenario with
an exact test. The typical formulation in the specialized literature is a 0/1 integer linear
programming model which considers a continuous processor frequency domain and determines
a single operating frequency per processor. One of the hypotheses tested in this
research is: stronger feasibility analysis offers tighter bounds for the problem. We believe that this can be observed, for example, in the results produced by solvers for fixed priority
schedulers, by means of an analysis based on a comparative study. By applying less accurate
schedulability tests, such as utilization based, the solvers take longer to converge to
optimal solutions, when compared to solvers that apply exact schedulability tests based
on response time analysis. Another hypothesis tested in this research is: practical instances
of the problem are timely solvable to optimal. We have experimented, by means of a comparative
study, on finding feasible solutions for workload for fixed priority schedulers with
up to 50 tasks distributed on four processors with seven different available frequencies. On
independent hard real-time tasks scheduled using EDF policy, we found optimal distribution
of up to 90 tasks on four processors with seven different available frequencies. In both
cases, the solutions were found within 30 min of execution time. Similarly, on dependent
tasks workload, we have optimally distributed 22 tasks, from an automotive control hard
real-time application, on four processors with seven different available frequencies, with
two shared resources and 23 precedence constraints within 1.5 h. We consider a few hours
in the design phase a price worth paying in this context. / .
|
8 |
An Automated Test Framework For Hard Real-Time Communication SystemsNagaiah, Mithun January 2012 (has links)
In the field of industrial automation there is a huge demand for real time communication networks and there are several different protocols like EtherCAT, PROFINET IO, SERCOS competing each other in the market. Many of the products in this industry are subjected to hard real-time communication requirements. The purpose of this thesis is in introducing tools to automatically test the various requirements that are helpful in deciding the performance of real time communication systems. Developing a well-defined test framework is one of the important tasks in this thesis project. The end users of the test framework can focus more on managing and analyzing the results from the framework instead of the design process. The thesis work presents the test requirements, design of test system and automating the measurement process by selecting appropriate hardware. The report also explains the design of commands, method used for communication between different systems and also discusses the different methods that could be applied for measuring the performance, the limitations of some of these methods when applied to the framework. The architecture and the working of the framework is covered in later chapters. The framework uses EtherCAT master communication stack developed in-house at ABB. EtherCAT is just used as a pilot test case, but in general the framework could be applied to other Ethernet based industrial communication protocols with suitable hardware or software modifications.
|
9 |
An Energy-Efficient Semi-Partitioned Approach for Hard Real-Time Systems with Voltage and Frequency IslandsPatterson, Jesse 01 May 2016 (has links)
The shift from uniprocessor to multi-core architectures has made it difficult to design predictable hard real-time systems (HRTS) since guaranteeing deadlines while achieving high processor utilization remains a major challenge. In addition, due to increasing demands, energy efficiency has become an important design metric in HRTS. To obtain energy savings, most multi-core systems use dynamic voltage and frequency scaling (DVFS) to reduce dynamic power consumption when the system is underloaded. However, in many multi-core systems, DVFS is implemented using voltage and frequency islands (VFI), implying that individual cores cannot independently select their voltage and frequency (v/f) pairs, thus resulting in less energy savings when existing energy-aware task assignment and scheduling techniques are used. In this thesis, we present an analysis of the increase in energy consumption in the presence of VFI. Further, we propose a semi-partitioned approach called EDF-hv to reduce the energy consumption of HRTS on multi-core systems with VFI. Simulation results revealed that when workload imbalance among the cores is sufficiently high, EDF-hv can reduce system energy consumption by 15.9% on average.
|
10 |
Scheduling of tasks in multiprocessor system using hybrid genetic algorithmsVarghese, B., Hossain, M. Alamgir, Dahal, Keshav P. January 2007 (has links)
This paper presents an investigation into the optimal scheduling of realtime
tasks of a multiprocessor system using hybrid genetic algorithms (GAs). A comparative
study of heuristic approaches such as `Earliest Deadline First (EDF)¿ and
`Shortest Computation Time First (SCTF)¿ and genetic algorithm is explored and
demonstrated. The results of the simulation study using MATLAB is presented and
discussed. Finally, conclusions are drawn from the results obtained that genetic algorithm
can be used for scheduling of real-time tasks to meet deadlines, in turn to obtain
high processor utilization.
|
Page generated in 0.0574 seconds