Deadline Missing Prediction Through the Use of Milestones

Distributed Real-Time Thread is an important concept for distributed real-time systems. Distributed Threads are schedulable entities with an end-to-end deadline that transpose nodes, carrying their scheduling context. In each node, the thread will be locally scheduled according to a local deadline, which is defined by a deadline partitioning algorithm. Mechanisms for predicting the missing of deadlines are fundamental if corrective actions are incorporated for improving system quality of service. In this work, a mechanism for predicting missing deadlines is proposed and evaluated through simulation. In order to illustrate the main characteristics of the proposed mechanism, experiments will be presented taking into account different scenarios of normal load and overload. Simulations show that the deadline missing prediction mechanism proposed presents good results for improving the overall performance and availability of distributed systems

A Hierarchical Scheduling Model for Dynamic Soft-Realtime System

We present a new hierarchical approximation and scheduling approach for applications and tasks with multiple modes on a single processor. Our model allows for a temporal and spatial distribution of the feasibility problem for a variable set of tasks with non-deterministic and fluctuating costs at runtime. In case of overloads an optimal degradation strategy selects one of several application modes or even temporarily deactivates applications. Hence, transient and permanent bottlenecks can be overcome with an optimal system quality, which is dynamically decided. This paper gives the first comprehensive and complete overview of all aspects of our research, including a novel CBS concept to confine entire applications, an evaluation of our system by using a video-on-demand application, an outline for adding further resource dimension, and aspects of our protoype implementation based on RTSJ

Control and Embedded Computing: Survey of Research Directions

This paper provides a survey of the role of feedback control in embedded realtimesystems, presented in the context of a new EU/IST Network of Excellence, ARTIST2.The survey highlights recent research efforts and future research directions in the areasof codesign of computer-based control systems, implementation-aware embedded controlsystems, and control of real-time computing systems

MARACAS: a real-time multicore VCPU scheduling framework

This paper describes a multicore scheduling and load-balancing framework called MARACAS, to address shared cache and memory bus contention. It builds upon prior work centered around the concept of virtual CPU (VCPU) scheduling. Threads are associated with VCPUs that have periodically replenished time budgets. VCPUs are guaranteed to receive their periodic budgets even if they are migrated between cores. A load balancing algorithm ensures VCPUs are mapped to cores to fairly distribute surplus CPU cycles, after ensuring VCPU timing guarantees. MARACAS uses surplus cycles to throttle the execution of threads running on specific cores when memory contention exceeds a certain threshold. This enables threads on other cores to make better progress without interference from co-runners. Our scheduling framework features a novel memory-aware scheduling approach that uses performance counters to derive an average memory request latency. We show that latency-based memory throttling is more effective than rate-based memory access control in reducing bus contention. MARACAS also supports cache-aware scheduling and migration using page recoloring to improve performance isolation amongst VCPUs. Experiments show how MARACAS reduces multicore resource contention, leading to improved task progress.http://www.cs.bu.edu/fac/richwest/papers/rtss_2016.pdfAccepted manuscrip

Proceedings Work-In-Progress Session of the 13th Real-Time and Embedded Technology and Applications Symposium

The Work-In-Progress session of the 13th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS\u2707) presents papers describing contributions both to state of the art and state of the practice in the broad field of real-time and embedded systems. The 17 accepted papers were selected from 19 submissions. This proceedings is also available as Washington University in St. Louis Technical Report WUCSE-2007-17, at http://www.cse.seas.wustl.edu/Research/FileDownload.asp?733. Special thanks go to the General Chairs – Steve Goddard and Steve Liu and Program Chairs - Scott Brandt and Frank Mueller for their support and guidance

Adaptive Resource Management for Uncertain Execution Platforms

Embedded systems are becoming increasingly complex. At the same time, the components that make up the system grow more uncertain in their properties. For example, current developments in CPU design focuses on optimizing for average performance rather than better worst case performance. This, combined with presence of 3rd party software components with unknown properties, makes resource management using prior knowledge less and less feasible. This thesis presents results on how to model software components so that resource allocation decisions can be made on-line. Both the single and multiple resource case is considered as well as extending the models to include resource constraints based on hardware dynam- ics. Techniques for estimating component parameters on-line are presented. Also presented is an algorithm for computing an optimal allocation based on a set of convex utility functions. The algorithm is designed to be computationally efficient and to use simple mathematical expres- sions that are suitable for fixed point arithmetics. An implementation of the algorithm and results from experiments is presented, showing that an adaptive strategy using both estimation and optimization can outperform a static approach in cases where uncertainty is high

Dynamic Resource Allocation in Embedded, High-Performance and Cloud Computing

The availability of many-core computing platforms enables a wide variety of technical solutions for systems across the embedded, high-performance and cloud computing domains. However, large scale manycore systems are notoriously hard to optimise. Choices regarding resource allocation alone can account for wide variability in timeliness and energy dissipation (up to several orders of magnitude). Dynamic Resource Allocation in Embedded, High-Performance and Cloud Computing covers dynamic resource allocation heuristics for manycore systems, aiming to provide appropriate guarantees on performance and energy efficiency. It addresses different types of systems, aiming to harmonise the approaches to dynamic allocation across the complete spectrum between systems with little flexibility and strict real-time guarantees all the way to highly dynamic systems with soft performance requirements. Technical topics presented in the book include: Load and Resource Models Admission Control Feedback-based Allocation and Optimisation Search-based Allocation Heuristics Distributed Allocation based on Swarm Intelligence Value-Based Allocation Each of the topics is illustrated with examples based on realistic computational platforms such as Network-on-Chip manycore processors, grids and private cloud environments.Note.-- EUR 6,000 BPC fee funded by the EC FP7 Post-Grant Open Access Pilo

Dynamic Resource Allocation in Embedded, High-Performance and Cloud Computing

The availability of many-core computing platforms enables a wide variety of technical solutions for systems across the embedded, high-performance and cloud computing domains. However, large scale manycore systems are notoriously hard to optimise. Choices regarding resource allocation alone can account for wide variability in timeliness and energy dissipation (up to several orders of magnitude). Dynamic Resource Allocation in Embedded, High-Performance and Cloud Computing covers dynamic resource allocation heuristics for manycore systems, aiming to provide appropriate guarantees on performance and energy efficiency. It addresses different types of systems, aiming to harmonise the approaches to dynamic allocation across the complete spectrum between systems with little flexibility and strict real-time guarantees all the way to highly dynamic systems with soft performance requirements. Technical topics presented in the book include: • Load and Resource Models• Admission Control• Feedback-based Allocation and Optimisation• Search-based Allocation Heuristics• Distributed Allocation based on Swarm Intelligence• Value-Based AllocationEach of the topics is illustrated with examples based on realistic computational platforms such as Network-on-Chip manycore processors, grids and private cloud environments

Sobre a aplicação de técnicas de controlo em redes industriais com falhas

Doutoramento em Engenharia EletrotécnicaThe performance of real-time networks is under continuous improvement as a result of several trends in the digital world. However, these tendencies not only cause improvements, but also exacerbates a series of unideal aspects of real-time networks such as communication latency, jitter of the latency and packet drop rate. This Thesis focuses on the communication errors that appear on such realtime networks, from the point-of-view of automatic control. Specifically, it investigates the effects of packet drops in automatic control over fieldbuses, as well as the architectures and optimal techniques for their compensation. Firstly, a new approach to address the problems that rise in virtue of such packet drops, is proposed. This novel approach is based on the simultaneous transmission of several values in a single message. Such messages can be from sensor to controller, in which case they are comprised of several past sensor readings, or from controller to actuator in which case they are comprised of estimates of several future control values. A series of tests reveal the advantages of this approach. The above-explained approach is then expanded as to accommodate the techniques of contemporary optimal control. However, unlike the aforementioned approach, that deliberately does not send certain messages in order to make a more efficient use of network resources; in the second case, the techniques are used to reduce the effects of packet losses. After these two approaches that are based on data aggregation, it is also studied the optimal control in packet dropping fieldbuses, using generalized actuator output functions. This study ends with the development of a new optimal controller, as well as the function, among the generalized functions that dictate the actuator’s behaviour in the absence of a new control message, that leads to the optimal performance. The Thesis also presents a different line of research, related with the output oscillations that take place as a consequence of the use of classic co-design techniques of networked control. The proposed algorithm has the goal of allowing the execution of such classical co-design algorithms without causing an output oscillation that increases the value of the cost function. Such increases may, under certain circumstances, negate the advantages of the application of the classical co-design techniques. A yet another line of research, investigated algorithms, more efficient than contemporary ones, to generate task execution sequences that guarantee that at least a given number of activated jobs will be executed out of every set composed by a predetermined number of contiguous activations. This algorithm may, in the future, be applied to the generation of message transmission patterns in the above-mentioned techniques for the efficient use of network resources. The proposed task generation algorithm is better than its predecessors in the sense that it is capable of scheduling systems that cannot be scheduled by its predecessor algorithms. The Thesis also presents a mechanism that allows to perform multi-path routing in wireless sensor networks, while ensuring that no value will be counted in duplicate. Thereby, this technique improves the performance of wireless sensor networks, rendering them more suitable for control applications. As mentioned before, this Thesis is centered around techniques for the improvement of performance of distributed control systems in which several elements are connected through a fieldbus that may be subject to packet drops. The first three approaches are directly related to this topic, with the first two approaching the problem from an architectural standpoint, whereas the third one does so from more theoretical grounds. The fourth approach ensures that the approaches to this and similar problems that can be found in the literature that try to achieve goals similar to objectives of this Thesis, can do so without causing other problems that may invalidate the solutions in question. Then, the thesis presents an approach to the problem dealt with in it, which is centered in the efficient generation of the transmission patterns that are used in the aforementioned approaches.Em resultado de várias tendências que têm afetado o mundo digital, o desempenho das redes de comunicação em tempo-real está continuamente a ser melhorado. No entanto, tais tendências não só introduzem melhorias, como também introduzem uma série de não idealidades, tais como a latência, o jitter da latência de comunicação e uma maior probabilidade de perda de pacotes. Esta tese tem o seu cerne em falhas de comunicação que surgem em tais redes, sob o ponto de vista do controlo automático. Concretamente, são estudados os efeitos das perdas de pacotes em redes de controlo, bem como arquitecturas e técnicas óptimas de compensação das mesmas. Primeiramente, ´e proposta uma nova abordagem para colmatar os problemas que surgem em virtude de tais perdas. Essa nova abordagem ´e baseada no envio simultâneo de vários valores numa única mensagem. Tais mensagens podem ser de sensor para controlador, caso em que as mesmas são constituídas por um conjunto de valores passados, ou de controlador para actuador, caso em que tais mensagens contˆem estimativas de futuros valores de controlo. Uma série de testes revela as vantagens de tal abordagem. A abordagem acima explanada ´e seguidamente expandida de modo a acomodar o controlo óptimo. Contudo, ao contrário da abordagem acima apresentada, que passa pelo não envio deliberado de certas mensagens com vista a alcançar um uso mais eficiente dos recursos de rede; no presente caso, as técnicas são usadas para reduzir os efeitos da perda de pacotes. Em seguida são estudadas abordagens de controlo óptimo que em situações de perda de pacotes empregam formas generalizadas da aplicação de valores de saída. Este estudo culmina com o desenvolvimento de um novo controlador óptimo, bem como a função, entre as funções generalizadas do funcionamento do actuador, que conduz o sistema a um desempenho óptimo. É também apresentada uma linha de investigação diferente, relacionada com a oscilação da saída que ocorre em consequência da utilização de técnicas e algoritmos clássicos de co-desenho de controlo e redes industriais. O algoritmo proposto tem como finalidade permitir que tais algoritmos clássicos possam ser executados sem causar oscilações de saída, oscilações que por sua vez aumentam o valor da função de custo. Tais aumentos da função do custo, podem, em certas circunstâncias, por em causa os benefícios da aplicação das técnicas de co-desenho clássico. Numa outra linha de investigação, foram estudadas formas, mais eficientes que as contemporâneas, de geração de sequências de execuções de tarefas que garantam que pelo menos um dado número de tarefas activadas serão executadas por cada conjunto contíguo composto por um número predefinido de activações. Esta técnica poderá, no futuro, ser aplicada na geração dos padrões de envio de mensagens que ´e empregue na abordagem de utilização eficiente dos recursos de rede acima referida. A técnica proposta de geração de tarefas é melhor que as anteriores no sentido em que a mesma é capaz de escalonar sistemas que não são escalonáveis pelas técnicas clássicas. A tese também apresenta um mecanismo que permite fazer o encaminhamento multi-caminho em redes de sensores sem fios com falhas sem causar a contagem em duplicado. Assim sendo a mesma técnica melhora o desempenho das redes de sensores sem fios, tornando as mesmas mais maleável as necessidades do controlo aum´atico em redes sem fios. Como foi referido acima, a tese foca-se em t´ecnicas de melhoria de desempenho de sistemas de controlo distribu´ıdo em que os v´arios elementos de controlo encontram-se interligados por meio de uma rede industrial que pode estar sujeita a perda de pacotes. As primeiras três abordagens cingemse a este tema, sendo que primeiras duas olham para o problema sob um ponto de vista arquitetural, enquanto que a terceira olha sob um ponto de vista mais teórico. A quarta abordagem garante que outras propostas que podem ser encontradas na literatura e que visam atingir resultados semelhantes aos que se pretendem atingir nesta tese, possam fazˆe-lo sem causar outros problemas que invalidem as soluções em questão. Seguidamente, é apresenta-se uma abordagem ao problema proposto nesta tese que foca-se na geração eficiente de padrões para subsequente utilização nas abordagens acima referidas. E por fim, apresentar-se-a uma técnica de optimização do funcionamento de redes sem fios que promete melhorar o controlo em tais redes

Practical Real-Time with Look-Ahead Scheduling

In my dissertation, I present ATLAS — the Auto-Training Look-Ahead Scheduler. ATLAS improves service to applications with regard to two non-functional properties: timeliness and overload detection. Timeliness is an important requirement to ensure user interface responsiveness and the smoothness of multimedia operations. Overload can occur when applications ask for more computation time than the machine can offer. Interactive systems have to handle overload situations dynamically at runtime. ATLAS provides timely service to applications, accessible through an easy-to-use interface. Deadlines specify timing requirements, workload metrics describe jobs. ATLAS employs machine learning to predict job execution times. Deadline misses are detected before they occur, so applications can react early.:1 Introduction 2 Anatomy of a Desktop Application 3 Real Simple Real-Time 4 Execution Time Prediction 5 System Scheduler 6 Timely Service 7 The Road Ahead Bibliography Inde