10 research outputs found
Efficient schedulability tests for real-time embedded systems with urgent routines
Task scheduling is one of the key mechanisms to ensure timeliness in embedded real-time systems. Such systems have often the need to execute not only application tasks but also some urgent routines (e.g. error-detection actions, consistency checkers, interrupt handlers) with minimum latency. Although fixed-priority schedulers such as Rate-Monotonic (RM) are in line with this need, they usually make a low processor utilization available to the system. Moreover, this availability usually decreases with the number of considered tasks. If dynamic-priority schedulers such as Earliest Deadline First (EDF) are applied instead, high system utilization can be guaranteed but the minimum latency for executing urgent routines may not be ensured.
In this paper we describe a scheduling model according to which urgent routines are executed at the highest priority level and all other system tasks are scheduled by EDF. We show that the guaranteed processor utilization for the assumed scheduling model is at least as high as the one provided by RM for two tasks, namely 2(2√−1). Seven polynomial time tests for checking the system timeliness are derived and proved correct. The proposed tests are compared against each other and to an exact but exponential running time test
Schedulability Analysis of Task Sets with Upper- and Lower-Bound Temporal Constraints
Increasingly, real-time systems must handle the self-suspension of tasks (that is, lower-bound wait times between subtasks) in a timely and predictable manner. A fast schedulability test that does not significantly overestimate the temporal resources needed to execute self-suspending task sets would be of benefit to these modern computing systems. In this paper, a polynomial-time test is presented that is known to be the first to handle nonpreemptive self-suspending task sets with hard deadlines, where each task has any number of self-suspensions. To construct the test, a novel priority scheduling policy is leveraged, the jth subtask first, which restricts the behavior of the self-suspending model to provide an analytical basis for an informative schedulability test. In general, the problem of sequencing according to both upper-bound and lower-bound temporal constraints requires an idling scheduling policy and is known to be nondeterministic polynomial-time hard. However, the tightness of the schedulability test and scheduling algorithm are empirically validated, and it is shown that the processor is able to effectively use up to 95% of the self-suspension time to execute tasks.Boeing Scientific Research LaboratoriesNational Science Foundation (U.S.). Graduate Research Fellowship (Grant 2388357
Fast Scheduling of Robot Teams Performing Tasks With Temporospatial Constraints
The application of robotics to traditionally manual manufacturing processes requires careful coordination between human and robotic agents in order to support safe and efficient coordinated work. Tasks must be allocated to agents and sequenced according to temporal and spatial constraints. Also, systems must be capable of responding on-the-fly to disturbances and people working in close physical proximity to robots. In this paper, we present a centralized algorithm, named 'Tercio,' that handles tightly intercoupled temporal and spatial constraints. Our key innovation is a fast, satisficing multi-agent task sequencer inspired by real-time processor scheduling techniques and adapted to leverage a hierarchical problem structure. We use this sequencer in conjunction with a mixed-integer linear program solver and empirically demonstrate the ability to generate near-optimal schedules for real-world problems an order of magnitude larger than those reported in prior art. Finally, we demonstrate the use of our algorithm in a multirobot hardware testbed
Real-Time and Energy-Efficient Routing for Industrial Wireless Sensor-Actuator Networks
With the emergence of industrial standards such as WirelessHART, process industries are adopting Wireless Sensor-Actuator Networks (WSANs) that enable sensors and actuators to communicate through low-power wireless mesh networks. Industrial monitoring and control applications require real-time communication among sensors, controllers and actuators within end-to-end deadlines. Deadline misses may lead to production inefficiency, equipment destruction to irreparable financial and environmental impacts. Moreover, due to the large geographic area and harsh conditions of many industrial plants, it is labor-intensive or dan- gerous to change batteries of field devices. It is therefore important to achieve long network lifetime with battery-powered devices.
This dissertation tackles these challenges and make a series of contributions. (1) We present a new end-to-end delay analysis for feedback control loops whose transmissions are scheduled based on the Earliest Deadline First policy. (2) We propose a new real-time routing algorithm that increases the real-time capacity of WSANs by exploiting the insights of the delay analysis. (3) We develop an energy-efficient routing algorithm to improve the network lifetime while maintaining path diversity for reliable communication. (4) Finally, we design a distributed game-theoretic algorithm to allocate sensing applications with near-optimal quality of sensing
Fast methods for scheduling with applications to real-time systems and large-scale, robotic manufacturing of aerospace structures
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2013.Cataloged from PDF version of thesis.Includes bibliographical references (pages 113-117).Across the aerospace and automotive manufacturing industries, there is a push to remove the cage around large, industrial robots and integrate right-sized, safe versions into the human labor force. By integrating robots into the labor force, humans can be freed to focus on value-added tasks (e.g. dexterous assembly) while the robots perform the non-value-added tasks (e.g. fetching parts). For this integration to be successful, the robots need to ability to reschedule their tasks online in response to unanticipated changes in the parameters of the manufacturing process. The problem of task allocation and scheduling is NP-Hard. To achieve good scalability characteristics, prior approaches to autonomous task allocation and scheduling use decomposition and distributed techniques. These methods work well for domains such as UAV scheduling when the temporospatial constraints can be decoupled or when low network bandwidth makes inter-agent communication difficult. However, the advantages of these methods are mitigated in the factory setting where the temporospatial constraints are tightly inter-coupled from the humans and robots working in close proximity and where there is sufficient network bandwidth. In this thesis, I present a system, called Tercio, that solves large-scale scheduling problems by combining mixed-integer linear programming to perform the agent allocation and a real-time scheduling simulation to sequence the task set. Tercio generates near optimal schedules for 10 agents and 500 work packages in less than 20 seconds on average and has been demonstrated in a multi-robot hardware test bed. My primary technical contributions are fast, near-optimal, real-time systems methods for scheduling and testing the schedulability of task sets. I also present a pilot study that investigates what level of control the Tercio should give human workers over their robotic teammates to maximize system efficiency and human satisfaction.by Matthew C. Gombolay.S.M
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