26 research outputs found
Real-time communications over switched Ethernet supporting dynamic QoS management
Doutoramento em Engenharia InformáticaDurante a última década temos assistido a um crescente aumento na utilização
de sistemas embutidos para suporte ao controlo de processos, de sistemas
robóticos, de sistemas de transportes e veículos e até de sistemas domóticos
e eletrodomésticos. Muitas destas aplicações são críticas em termos de
segurança de pessoas e bens e requerem um alto nível de determinismo com
respeito aos instantes de execução das respectivas tarefas. Além disso, a implantação
destes sistemas pode estar sujeita a limitações estruturais, exigindo
ou beneficiando de uma configuração distribuída, com vários subsistemas
computacionais espacialmente separados. Estes subsistemas, apesar de
espacialmente separados, são cooperativos e dependem de uma infraestrutura
de comunicação para atingir os objectivos da aplicação e, por consequência,
também as transacções efectuadas nesta infraestrutura estão sujeitas às
restrições temporais definidas pela aplicação.
As aplicações que executam nestes sistemas distribuídos, chamados
networked embedded systems (NES), podem ser altamente complexas e
heterogéneas, envolvendo diferentes tipos de interacções com diferentes
requisitos e propriedades. Um exemplo desta heterogeneidade é o modelo de
activação da comunicação entre os subsistemas que pode ser desencadeada
periodicamente de acordo com uma base de tempo global (time-triggered),
como sejam os fluxos de sistemas de controlo distribuído, ou ainda ser
desencadeada como consequência de eventos assíncronos da aplicação
(event-triggered). Independentemente das características do tráfego ou do
seu modelo de activação, é de extrema importância que a plataforma de
comunicações disponibilize as garantias de cumprimento dos requisitos da
aplicação ao mesmo tempo que proporciona uma integração simples dos
vários tipos de tráfego.
Uma outra propriedade que está a emergir e a ganhar importância no seio
dos NES é a flexibilidade. Esta propiedade é realçada pela necessidade de
reduzir os custos de instalação, manutenção e operação dos sistemas. Neste
sentido, o sistema é dotado da capacidade para adaptar o serviço fornecido à
aplicação aos respectivos requisitos instantâneos, acompanhando a evolução
do sistema e proporcionando uma melhor e mais racional utilização dos
recursos disponíveis.
No entanto, maior flexibilidade operacional é igualmente sinónimo de
maior complexidade derivada da necessidade de efectuar a alocação dinâmica
dos recursos, acabando também por consumir recursos adicionais no sistema.
A possibilidade de modificar dinâmicamente as caracteristicas do sistema
também acarreta uma maior complexidade na fase de desenho e especificação.
O aumento do número de graus de liberdade suportados faz aumentar
o espaço de estados do sistema, dificultando a uma pre-análise. No sentido de
conter o aumento de complexidade são necessários modelos que representem
a dinâmica do sistema e proporcionem uma gestão optimizada e justa dos
recursos com base em parâmetros de qualidade de serviço (QdS).
É nossa tese que as propriedades de flexibilidade, pontualidade e gestão
dinâmica de QdS podem ser integradas numa rede switched Ethernet (SE),
tirando partido do baixo custo, alta largura de banda e fácil implantação. Nesta
dissertação é proposto um protocolo, Flexible Time-Triggered communication
over Switched Ethernet (FTT-SE), que suporta as propriedades desejadas e
que ultrapassa as limitações das redes SE para aplicações de tempo-real tais
como a utilização de filas FIFO, a existência de poucos níveis de prioridade
e a pouca capacidade de gestão individualizada dos fluxos. O protocolo
baseia-se no paradigma FTT, que genericamente define a arquitectura de uma
pilha protocolar sobre o acesso ao meio de uma rede partilhada, impondo
desta forma determinismo temporal, juntamente com a capacidade para
reconfiguração e adaptação dinâmica da rede. São ainda apresentados vários
modelos de distribuição da largura de banda da rede de acordo com o nível de
QdS especificado por cada serviço utilizador da rede.
Esta dissertação expõe a motivação para a criação do protocolo FTT-SE,
apresenta uma descrição do mesmo, bem como a análise de algumas das
suas propiedades mais relevantes. São ainda apresentados e comparados
modelos de distribuição da QdS. Finalmente, são apresentados dois casos de
aplicações que sustentam a validade da tese acima mencionada.During the last decade we have witnessed a massive deployment of embedded
systems on a wide applications range, from industrial automation to process
control, avionics, cars or even robotics. Many of these applications have an
inherently high level of criticality, having to perform tasks within tight temporal
constraints. Additionally, the configuration of such systems is often distributed,
with several computing nodes that rely on a communication infrastructure to
cooperate and achieve the application global goals. Therefore, the communications
are also subject to the same temporal constraints set by the application
requirements.
Many applications relying on such networked embedded systems (NES)
are complex and heterogeneous, comprehending different activities with different
requirements and properties. For example, the communication between
subsystems may follow a strict temporal synchronization with respect to a
global time-base (time-triggered), like in a distributed feedback control loop,
or it may be issued asynchronously upon the occurrence of events (eventtriggered).
Regardless of the traffic characteristics and its activation model, it
is of paramount importance having a communication framework that provides
seamless integration of heterogeneous traffic sources while guaranteeing the
application requirements.
Another property that has been emerging as important for NES design and
operation is flexibility. The need to reduce installation and operational costs,
while facilitating maintenance is promoting a more rational use of the available
resources at run-time, exploring the ability to tune service parameters as the
system evolves.
However, such operational flexibility comes with the cost of increasing the
complexity of the system to handle the dynamic resource management, which
on the other hand demands the allocation of additional system resources.
Moreover, the capacity to dynamically modify the system properties also
causes a higher complexity when designing and specifying the system, since
the operational state-space increases with the degrees of flexibility of the
system.
Therefore, in order to bound this complexity appropriate operational models
are needed to handle the system dynamics and carry on an efficient and
fair resource management strategy based on quality of service (QoS) metrics.
This thesis states that the properties of flexibility and timeliness as needed
for dynamic QoS management can be provided to switched Ethernet based
systems. Switched Ethernet, although initially designed for general purpose
Internet access and file transfers, is becoming widely used in NES-based applications.
However, COTS switched Ethernet is insufficient regarding the needs
for real-time predictability and for supporting the aforementioned properties due
the use of FIFO queues too few priority levels and for stream-level management
capabilities. In this dissertation we propose a protocol to overcome those
limitations, namely the Flexible Time-Triggered communication over Switched
Ethernet (FTT-SE). The protocol is based on the FTT paradigm that generically
defines a protocol architecture suitable to enforce real-time determinism on a
communication network supporting the desired flexibility properties.
This dissertation addresses the motivation for FTT-SE, describing the
protocol as well as its schedulability analysis. It additionally covers the resource
distribution topic, where several distribution models are proposed to manage
the resource capacity among the competing services and while considering
the QoS level requirements of each service. A couple of application cases are
shown that support the aforementioned thesis
Architecture for Guaranteed Delay Service in High Speed Networks
The increasing importance of network connections coupled with the lack of abundant link capacity suggests that the day when service guarantees are required by individual connections is not far off. In this dissertation we describe a networking architecture that can efficiently provide end-to-end delay guarantees on a per- connection basis. In order to provide any kind of service guarantee it is imperative for the source traffic to be accurately characterized at the ingress to the network. Furthermore, this characterization should be enforceable through the use of a traffic shaper (or similar device). We go one step further and assume an extensive use of traffic shapers at each of the network elements. Reshaping makes the traffic at each node more predictable and therefore simplifies the task of providing efficient delay guarantees to individual connections. The use of per-connection reshapers to regulate traffic at each hop in the network is referred to as a Rate Controlled Service (RCS) discipline. By exploiting some properties of traffic shapers we demonstrate how the per-hop reshaping does not increase the bound on the end-to-end delay experienced by a connection. In particular, we show that an appropriate choice of traffic shaper parameters enables the RCS discipline to provide better end-to- end delay guarantees than any other service discipline known today. The RCS discipline can provide efficient end-to-end delay guarantees to a connection; however, by definition it is not work-conserving. This fact may increase the average delay that is observed by a connection even if there is no congestion in the network. We outline a mechanism by which an RCS discipline can be modified to be work-conserving without sacrificing the efficient end-to-end delay guarantees that can be provided to individual connections. Using the notion of service curves to bound the service process at each network element, we are able to provide an upper bound on the buffers required to ensure zero loss at the network element. Finally, we examine how the RCS discipline can be used in the context of the Guaranteed Services specification that is currently in the process of being standardized by the Internet Engineering Task Force
Optimized event notification in CAN through in-frame replies and Bloom filters
Thanks to its distributed and asynchronous medium access control mechanism, CAN is the ideal choice for interconnecting devices in event-driven systems. When timing requirements of applications are not particularly demanding, as in the case of, e.g., reactive and proactive maintenance, constraints on event delivery can be relaxed, so that their notification may rely on best-effort approaches. In this paper, a number of techniques are taken into account for notifying events in such a kind of systems, and their performance has been evaluated. Besides conventional CAN, a recent proposal for extending this protocol, termed CAN XR, is considered. Moreover, the adoption of Bloom filters to cope with rare events in very large systems has also been evaluated
Real-Time Scheduling for GPUs with Applications in Advanced Automotive Systems
Self-driving cars, once constrained to closed test tracks, are beginning to drive alongside human drivers on public roads. Loss of life or property may result if the computing systems of automated vehicles fail to respond to events at the right moment. We call such systems that must satisfy precise timing constraints “real-time systems.” Since the 1960s, researchers have developed algorithms and analytical techniques used in the development of real-time systems; however, this body of knowledge primarily applies to traditional CPU-based platforms. Unfortunately, traditional platforms cannot meet the computational requirements of self-driving cars without exceeding the power and cost constraints of commercially viable vehicles. We argue that modern graphics processing units, or GPUs, represent a feasible alternative, but new algorithms and analytical techniques must be developed in order to integrate these uniquely constrained processors into a real-time system. The goal of the research presented in this dissertation is to discover and remedy the issues that prevent the use of GPUs in real-time systems. To overcome these issues, we design and implement a real-time multi-GPU scheduler, called GPUSync. GPUSync tightly controls access to a GPU’s computational and DMA processors, enabling simultaneous use despite potential limitations in GPU hardware. GPUSync enables tasks to migrate among GPUs, allowing new classes of real-time multi-GPU computing platforms. GPUSync employs heuristics to guide scheduling decisions to improve system efficiency without risking violations in real-time constraints. GPUSync may be paired with a wide variety of common real-time CPU schedulers. GPUSync supports closed-source GPU runtimes and drivers without loss in functionality. We evaluate GPUSync with both analytical and runtime experiments. In our analytical experiments, we model and evaluate over fifty configurations of GPUSync. We determine which configurations support the greatest computational capacity while maintaining real-time constraints. In our runtime experiments, we execute computer vision programs similar to those found in automated vehicles, with and without GPUSync. Our results demonstrate that GPUSync greatly reduces jitter in video processing. Research into real-time systems with GPUs is a new area of study. Although there is prior work on such systems, no other GPU scheduling framework is as comprehensive and flexible as GPUSync.Doctor of Philosoph