Energy and power aware scheduling algorithm modeling for battery powered embedded systems

Energy management has always been recognized as a challenge in mobile systems, especially in modern OS-based mobile systems where multi-functioning are widely supported. Nowadays, it is common for a mobile system user to run multiple applications simultaneously while having a target battery lifetime in mind for a specific application. Traditional OS-level power management (PM) policies make their best effort to save energy under performance constraint, but fail to guarantee a target lifetime, leaving the painful trading off between the total performance of applications and the target lifetime to the user itself. This thesis provides a new way to deal with the problem. It is advocated that a strong energy-aware PM scheme should first guarantee a user-specified battery lifetime to a target application by restricting the average power of those less important applications, and in addition to that, maximize the total performance of applications without harming the lifetime guarantee. As a support, energy, instead of CPU or transmission bandwidth, should be globally managed as the first-class resource by the OS. As the first-stage work of a complete PM scheme, this thesis presents the energy-based fair queuing scheduling, a novel class of energy-aware scheduling algorithms which, in combination with a mechanism of battery discharge rate restricting, systematically manage energy as the first-class resource with the objective of guaranteeing a user-specified battery lifetime for a target application in OS-based mobile systems. Energy-based fair queuing is a cross-application of the traditional fair queuing in the energy management domain. It assigns a power share to each task, and manages energy by proportionally serving energy to tasks according to their assigned power shares. The proportional energy use establishes proportional share of the system power among tasks, which guarantees a minimum power for each task and thus, avoids energy starvation on any task. Energy-based fair queuing treats all tasks equally as one type and supports periodical time-sensitive tasks by allocating each of them a share of system power that is adequate to meet the highest energy demand in all periods. However, an overly conservative power share is usually required to guarantee the meeting of all time constraints. To provide more effective and flexible support for various types of time-sensitive tasks in general purpose operating systems, an extra real-time friendly mechanism is introduced to combine priority-based scheduling into the energy-based fair queuing. Since a method is available to control the maximum time one time-sensitive task can run with priority, the power control and time-constraint meeting can be flexibly traded off. A SystemC-based test-bench is designed to assess the algorithms. Simulation results show the success of the energy-based fair queuing in achieving proportional energy use, time-constraint meeting, and a proper trading off between them. La gestión de energía en los sistema móviles está considerada hoy en día como un reto fundamental, notándose, especialmente, en aquellos terminales que utilizando un sistema operativo implementan múltiples funciones. Es común en los sistemas móviles actuales ejecutar simultaneamente diferentes aplicaciones y tener, para una de ellas, un objetivo de tiempo de uso de la batería. Tradicionalmente, las políticas de gestión de consumo de potencia de los sistemas operativos hacen lo que está en sus manos para ahorrar energía y satisfacer sus requisitos de prestaciones, pero no son capaces de proporcionar un objetivo de tiempo de utilización del sistema, dejando al usuario la difícil tarea de buscar un compromiso entre prestaciones y tiempo de utilización del sistema. Esta tesis, como contribución, proporciona una nueva manera de afrontar el problema. En ella se establece que un esquema de gestión de consumo de energía debería, en primer lugar, garantizar, para una aplicación dada, un tiempo mínimo de utilización de la batería que estuviera especificado por el usuario, restringiendo la potencia media consumida por las aplicaciones que se puedan considerar menos importantes y, en segundo lugar, maximizar las prestaciones globales sin comprometer la garantía de utilización de la batería. Como soporte de lo anterior, la energía, en lugar del tiempo de CPU o el ancho de banda, debería gestionarse globalmente por el sistema operativo como recurso de primera clase. Como primera fase en el desarrollo completo de un esquema de gestión de consumo, esta tesis presenta un algoritmo de planificación de encolado equitativo (fair queueing) basado en el consumo de energía, es decir, una nueva clase de algoritmos de planificación que, en combinación con mecanismos que restrinjan la tasa de descarga de una batería, gestionen de forma sistemática la energía como recurso de primera clase, con el objetivo de garantizar, para una aplicación dada, un tiempo de uso de la batería, definido por el usuario, en sistemas móviles empotrados. El encolado equitativo de energía es una extensión al dominio de la energía del encolado equitativo tradicional. Esta clase de algoritmos asigna una reserva de potencia a cada tarea y gestiona la energía sirviéndola de manera proporcional a su reserva. Este uso proporcional de la energía garantiza que cada tarea reciba una porción de potencia y evita que haya tareas que se vean privadas de recibir energía por otras con un comportamiento más ambicioso. Esta clase de algoritmos trata a todas las tareas por igual y puede planificar tareas periódicas en tiempo real asignando a cada una de ellas una reserva de potencia que es adecuada para proporcionar la mayor de las cantidades de energía demandadas por período. Sin embargo, es posible demostrar que sólo se consigue cumplir con los requisitos impuestos por todos los plazos temporales con reservas de potencia extremadamente conservadoras. En esta tesis, para proporcionar un soporte más flexible y eficiente para diferentes tipos de tareas de tiempo real junto con el resto de tareas, se combina un mecanismo de planificación basado en prioridades con el encolado equitativo basado en energía. En esta clase de algoritmos, gracias al método introducido, que controla el tiempo que se ejecuta con prioridad una tarea de tiempo real, se puede establecer un compromiso entre el cumplimiento de los requisitos de tiempo real y el consumo de potencia. Para evaluar los algoritmos, se ha diseñado en SystemC un banco de pruebas. Los resultados muestran que el algoritmo de encolado equitativo basado en el consumo de energía consigue el balance entre el uso proporcional a la energía reservada y el cumplimiento de los requisitos de tiempo real.

PARTIAL STABILITY FOR A CLASS OF NONLINEAR SYSTEMS

This paper studies a nonlinear, discrete-time matrix system arising in the stability analysis of Kalman filters. These systems present an internal coupling between the state components that gives rise to complex dynamic behavior. The problem of partial stability, which requires that a specific component of the state of the system converge exponentially, is studied and solved. The convergent state component is strongly linked with the behavior of Kalman filters, since it can be used to provide bounds for the error covariance matrix under uncertainties in the noise measurements. We exploit the special features of the system-mainly the connections with linear systems-to obtain an algebraic test for partial stability. Finally, motivated by applications in which polynomial divergence of the estimates is acceptable, we study and solve a partial semistability problem.

SYNCHRONIZATION OF A CLASS OF SECOND-ORDER NONLINEAR SYSTEMS

The asymptotic behavior of a class of coupled second-order nonlinear dynamical systems is studied in this paper. Using very mild assumptions on the vector-field, conditions on the coupling parameters that guarantee synchronization are provided. The proposed result does not require solutions to be ultimately bounded in order to prove synchronization, therefore it can be used to study coupled systems that do not globally synchronize, including synchronization of unbounded solutions. In this case, estimates of the synchronization region are obtained. Synchronization of two-coupled nonlinear pendulums and two-coupled Duffing systems are studied to illustrate the application of the proposed theory.

Evaluation of three different adhesive systems using a bacterial method to develop secondary caries in vitro

Purpose: To assess the effects of three different dental adhesive systems on the formation of secondary root caries, in vitro, with a standardized interfacial gap in a filled cavity model. Methods: 40 sound human molars were selected and randomly assigned to four experimental groups: Clearfil SE Bond (CSEB), Xeno III (X-III), Scotchbond Multi-Purpose Plus (SBMP) and negative control (NC) without an adhesive system. After the standardized Class V cavity preparations on the buccal and lingual surfaces, restorations were placed with resin composite (Filtek Z250) using a standardized interfacial gap, using a 3 x 2 mm piece of 50 mu m metal matrix. The teeth were sterilized with gamma irradiation and exposed to a cariogenic challenge using a bacterial system with Streptococcus mutans. Depth and extension of wall lesions formed and the depth of outer lesions were measured by software coupled with light microscopy. Results: For wall lesion extension the ANOVA test showed differences between groups except between X-HI and SBMP (P= 0.294). The Tukey`s test of confidence intervals indicated smaller values for the CSEB group than for the others. For wall lesion depth the CSEB group also presented the smallest mean values of wall lesion depth when compared to the others (P< 0.0001) for all comparisons using Tukey`s test. Regarding outer lesion depth, all adhesives showed statistically similar behavior. SEM evaluation of the morphologic appearance of caries lesions confirmed the statistical results showing small caries lesion development for cavities restored with CSEB adhesive system, which may suggest that this adhesive system interdiffusion zone promoted a good interaction with subjacent dentin protecting the dental tissues from recurrent caries. (Am J Dent 2010;23:93-97).

Effects of Nd:YAG Laser Irradiation on the Hybrid Layer of Different Adhesive Systems

Purpose: The aim of this in vitro study was to evaluate the microtensile bond strength (mu TBS) and hybrid layer morphology of different adhesive systems, either followed by treatment with Nd:YAG laser irradiation or not. Previous studies have shown the effects of Nd:YAG laser irradiation on the dentin surface at restoration margins, but there are few reports about the significance of the irradiation on the hybrid layer. Materials and Methods: The flattened coronal and root dentin samples of 24 bovine teeth were randomly divided into 8 groups, according to the adhesive system used - Scotchbond Multi Purpose (SBMP) or Clearfil SE Bond (CSEB) - and were either irradiated with Nd:YAG or not, with different parameters: 0.8 W/10 Hz, 0.8 W/20 Hz, 1.2 W/10 Hz, 1.2 W/20 Hz. The left sides of specimens were the control groups, and right sides were irradiated. A composite crown was built over bonded surfaces and stored in water (24 h at 37 degrees C). Specimens were sectioned vertically into slabs that were subjected to mu TBS testing and observed by SEM. Results: Control groups (27.81 +/- 1.38) showed statistically higher values than lased groups (21.37 +/- 0.99), and CSEB control group values (31.26 +/- 15.71) were statistically higher than those of SBMP (24.3 +/- 10.66). There were no significant differences between CSEB (20.34 +/- 10.01) and SBMP (22.43 +/- 9.82) lased groups. Among parameters tested, 0.8 W/10 Hz showed the highest value (25.54 +/- 11.74). Nd:YAG laser irradiation caused dentin to melt under the adhesive layer of both adhesive systems tested. Conclusion: With the parameters used in this study, Nd:YAG laser irradiation of the hybrid layer promoted morphological changes in dentin and negatively influenced the bond strength of both adhesive systems.

Orthodontic-surgical treatment of Class III malocclusion with extraction of an impacted canine and multi-segmented maxillary surgery

Establishment of a treatment plan is based on efficacy and easy application by the clinician, and acceptance by the patient. Treatment of adult patients with Class III malocclusion might require orthognathic surgery, especially when the deformity is severe, with a significant impact on facial esthetics. Impacted teeth can remarkably influence treatment planning, which should be precise and concise to allow a reasonably short treatment time with low biologic cost. We report here the case of a 20-year-old man who had a skeletal Class III malocclusion and impaction of the maxillary right canine, leading to remarkable deviation of the maxillary midline; this was his chief complaint. Because of the severely deviated position of the impacted canine, treatment included extraction of the maxillary right canine and left first premolar for midline correction followed by leveling, alignment, correction of compensatory tooth positioning, and orthognathic surgery to correct the skeletal Class III malocclusion because of the severe maxillary deficiency. This treatment approach allowed correction of the maxillary dental midline discrepancy to the midsagittal plane and establishment of good occlusion and optimal esthetics. (Am J Orthod Dentofacial Orthop 2010;137:840-9)

Synthesis and Coordination Chemistry of a New N-4-Polydentate Class of Pyridyl-Functionalized Scorpionate Ligands: Complexes of Fe-II, Zn-II, V-IV, Pd-II and Use for Heterobimetallic Systems

The new potentially N-4-multidentate pyridyl-functionalized scorpionates 4-((tris-2,2,2-(pyrazol-1-ypethoxy)methyl)pyridine (TpmPy, (1)) and 4-((tris-2,2,2-(3-phenylpyrazol-1-yl)ethoxy)methyl)pyridine (TpmPy(Ph), (2)) have been synthesized and their coordination behavior toward Fe-II, Ni-II, Zn-II, Cu-II, Pd-II, and V-III centers has been studied. Reaction of (1) with Fe(BF4)(2)center dot 6H(2)O yields [Fe(TpmPy)(2)](BF4)(2) (3), that, in the solid state, shows the sandwich structure with trihapto ligand coordination via the pyrazolyl arms, and is completely low spin (LS) until 400 K. Reactions of 2 equiv of (1) or (2) with Zn-II or Ni-II chlorides give the corresponding metal complexes with general formula [MCl2(TpmPy*)(2)] (M = Zn, Ni; TpmPy* = TpmPy, TpmPy(Ph)) (4-7) where the ligand is able to coordinate through either the pyrazolyl rings (in case of [Ni(TpmPy)(2)Cl-2 (5)) or the pyridyl-side (for [ZnCl2(TpmPy)(2)] (4), [ZnCl2(TpmPy(Ph))(2)] (6) and [NiCl2(TpmPy(Ph))(2)] (7)). The reaction of (1) with VCl3 gives [VOCl2(TpmPy)] (8) that shows the N-3-pyrazolyl coordination-mode. Moreover, (1) and react with cis-[PdCl2(CH3CN)(2)] to give the disubstituted complexes [PdCl2(TprnPy)(2)] (9) and [PdCl2(TpmPy(Ph))(2)] (10), respectively, bearing the scorpionate coordinated via the pyridyl group. Compounds (9) and (10) react with Fe(BF4)(2) to give the heterobimetallic Pd/Fe systems [PdCl2(mu-TpmPy)(2)-Fe](BF4)(2) (11) and [PdCl2(mu-TpmPy(Ph))(2)Fe-2(H2O)(6)]BF4)(4) (13), respectively. Compound (11) can also be formed from reaction of (3) with cis-[PdCl2(CH3CN)(2)], while reaction of (3) with Cu(NO3)(2).2.5H(2)O generates [Fe(mu-TpmPy)(2)-Cu(NO3)(2)](BF4)(2) (12), confirming the multidentate ability of the new chelating ligands. The X-ray diffraction analyses of compounds (1), (3), (4), (5), and (9) are also reported.

RFID together with multi-agent systems to control global value chains

Nowadays, the cooperative intelligent transport systems are part of a largest system. Transportations are modal operations integrated in logistics and, logistics is the main process of the supply chain management. The supply chain strategic management as a simultaneous local and global value chain is a collaborative/cooperative organization of stakeholders, many times in co-opetition, to perform a service to the customers respecting the time, place, price and quality levels. The transportation, like other logistics operations must add value, which is achieved in this case through compression lead times and order fulfillments. The complex supplier's network and the distribution channels must be efficient and the integral visibility (monitoring and tracing) of supply chain is a significant source of competitive advantage. Nowadays, the competition is not discussed between companies but among supply chains. This paper aims to evidence the current and emerging manufacturing and logistics system challenges as a new field of opportunities for the automation and control systems research community. Furthermore, the paper forecasts the use of radio frequency identification (RFID) technologies integrated into an information and communication technologies (ICT) framework based on distributed artificial intelligence (DAI) supported by a multi-agent system (MAS), as the most value advantage of supply chain management (SCM) in a cooperative intelligent logistics systems. Logistical platforms (production or distribution) as nodes of added value of supplying and distribution networks are proposed as critical points of the visibility of the inventory, where these technological needs are more evident.

Multi-criteria short-term maintenance outage scheduling in smart distribution systems

Effective legislation and standards for the coordination procedures between consumers, producers and the system operator supports the advances in the technologies that lead to smart distribution systems. In short-term (ST) maintenance scheduling procedure, the energy producers in a distribution system access to the long-term (LT) outage plan that is released by the distribution system operator (DSO). The impact of this additional information on the decision-making procedure of producers in ST maintenance scheduling is studied in this paper. The final ST maintenance plan requires the approval of the DSO that has the responsibility to secure the network reliability and quality, and other players have to follow the finalized schedule. Maintenance scheduling in the producers’ layer and the coordination procedure between them and the DSO is modelled in this paper. The proposed method is applied to a 33-bus distribution system.

Multi-agent systems and birtual producers in electronic marketplaces

This paper presents an agent-based simulator designed for analyzing agent market strategies based on a complete understanding of buyer and seller behaviours, preference models and pricing algorithms, considering user risk preferences. The system includes agents that are capable of improving their performance with their own experience, by adapting to the market conditions. In the simulated market agents interact in several different ways and may joint together to form coalitions. In this paper we address multi-agent coalitions to analyse Distributed Generation in Electricity Markets

Supporting intra-task parallelism in real-time multiprocessor systems

Os sistemas de tempo real modernos geram, cada vez mais, cargas computacionais pesadas e dinâmicas, começando-se a tornar pouco expectável que sejam implementados em sistemas uniprocessador. Na verdade, a mudança de sistemas com um único processador para sistemas multi- processador pode ser vista, tanto no domínio geral, como no de sistemas embebidos, como uma forma eficiente, em termos energéticos, de melhorar a performance das aplicações. Simultaneamente, a proliferação das plataformas multi-processador transformaram a programação paralela num tópico de elevado interesse, levando o paralelismo dinâmico a ganhar rapidamente popularidade como um modelo de programação. A ideia, por detrás deste modelo, é encorajar os programadores a exporem todas as oportunidades de paralelismo através da simples indicação de potenciais regiões paralelas dentro das aplicações. Todas estas anotações são encaradas pelo sistema unicamente como sugestões, podendo estas serem ignoradas e substituídas, por construtores sequenciais equivalentes, pela própria linguagem. Assim, o modo como a computação é na realidade subdividida, e mapeada nos vários processadores, é da responsabilidade do compilador e do sistema computacional subjacente. Ao retirar este fardo do programador, a complexidade da programação é consideravelmente reduzida, o que normalmente se traduz num aumento de produtividade. Todavia, se o mecanismo de escalonamento subjacente não for simples e rápido, de modo a manter o overhead geral em níveis reduzidos, os benefícios da geração de um paralelismo com uma granularidade tão fina serão meramente hipotéticos. Nesta perspetiva de escalonamento, os algoritmos que empregam uma política de workstealing são cada vez mais populares, com uma eficiência comprovada em termos de tempo, espaço e necessidades de comunicação. Contudo, estes algoritmos não contemplam restrições temporais, nem outra qualquer forma de atribuição de prioridades às tarefas, o que impossibilita que sejam diretamente aplicados a sistemas de tempo real. Além disso, são tradicionalmente implementados no runtime da linguagem, criando assim um sistema de escalonamento com dois níveis, onde a previsibilidade, essencial a um sistema de tempo real, não pode ser assegurada. Nesta tese, é descrita a forma como a abordagem de work-stealing pode ser resenhada para cumprir os requisitos de tempo real, mantendo, ao mesmo tempo, os seus princípios fundamentais que tão bons resultados têm demonstrado. Muito resumidamente, a única fila de gestão de processos convencional (deque) é substituída por uma fila de deques, ordenada de forma crescente por prioridade das tarefas. De seguida, aplicamos por cima o conhecido algoritmo de escalonamento dinâmico G-EDF, misturamos as regras de ambos, e assim nasce a nossa proposta: o algoritmo de escalonamento RTWS. Tirando partido da modularidade oferecida pelo escalonador do Linux, o RTWS é adicionado como uma nova classe de escalonamento, de forma a avaliar na prática se o algoritmo proposto é viável, ou seja, se garante a eficiência e escalonabilidade desejadas. Modificar o núcleo do Linux é uma tarefa complicada, devido à complexidade das suas funções internas e às fortes interdependências entre os vários subsistemas. Não obstante, um dos objetivos desta tese era ter a certeza que o RTWS é mais do que um conceito interessante. Assim, uma parte significativa deste documento é dedicada à discussão sobre a implementação do RTWS e à exposição de situações problemáticas, muitas delas não consideradas em teoria, como é o caso do desfasamento entre vários mecanismo de sincronização. Os resultados experimentais mostram que o RTWS, em comparação com outro trabalho prático de escalonamento dinâmico de tarefas com restrições temporais, reduz significativamente o overhead de escalonamento através de um controlo de migrações, e mudanças de contexto, eficiente e escalável (pelo menos até 8 CPUs), ao mesmo tempo que alcança um bom balanceamento dinâmico da carga do sistema, até mesmo de uma forma não custosa. Contudo, durante a avaliação realizada foi detetada uma falha na implementação do RTWS, pela forma como facilmente desiste de roubar trabalho, o que origina períodos de inatividade, no CPU em questão, quando a utilização geral do sistema é baixa. Embora o trabalho realizado se tenha focado em manter o custo de escalonamento baixo e em alcançar boa localidade dos dados, a escalonabilidade do sistema nunca foi negligenciada. Na verdade, o algoritmo de escalonamento proposto provou ser bastante robusto, não falhando qualquer meta temporal nas experiências realizadas. Portanto, podemos afirmar que alguma inversão de prioridades, causada pela sub-política de roubo BAS, não compromete os objetivos de escalonabilidade, e até ajuda a reduzir a contenção nas estruturas de dados. Mesmo assim, o RTWS também suporta uma sub-política de roubo determinística: PAS. A avaliação experimental, porém, não ajudou a ter uma noção clara do impacto de uma e de outra. No entanto, de uma maneira geral, podemos concluir que o RTWS é uma solução promissora para um escalonamento eficiente de tarefas paralelas com restrições temporais.

Supporting real-time distributed computer-controlled systems with multi-hop P-NET networks

Fieldbus communication networks aim to interconnect sensors, actuators and controllers within process control applications. Therefore, they constitute the foundation upon which real-time distributed computer-controlled systems can be implemented. P-NET is a fieldbus communication standard, which uses a virtual token-passing medium-access-control mechanism. In this paper pre-run-time schedulability conditions for supporting real-time traffic with P-NET networks are established. Essentially, formulae to evaluate the upper bound of the end-to-end communication delay in P-NET messages are provided. Using this upper bound, a feasibility test is then provided to check the timing requirements for accessing remote process variables. This paper also shows how P-NET network segmentation can significantly reduce the end-to-end communication delays for messages with stringent timing requirements.

Multi-μ: an Ada 95 based architecture for fault tolerance support of real-time systems

This paper presents an architecture (Multi-μ) being implemented to study and develop software based fault tolerant mechanisms for Real-Time Systems, using the Ada language (Ada 95) and Commercial Off-The-Shelf (COTS) components. Several issues regarding fault tolerance are presented and mechanisms to achieve fault tolerance by software active replication in Ada 95 are discussed. The Multi-μ architecture, based on a specifically proposed Fault Tolerance Manager (FTManager), is then described. Finally, some considerations are made about the work being done and essential future developments.

Dynamical behaviour of multi-particle large-scale systems

Collective behaviours can be observed in both natural and man-made systems composed of a large number of elemental subsystems. Typically, each elemental subsystem has its own dynamics but, whenever interaction between individuals occurs, the individual behaviours tend to be relaxed, and collective behaviours emerge. In this paper, the collective behaviour of a large-scale system composed of several coupled elemental particles is analysed. The dynamics of the particles are governed by the same type of equations but having different parameter values and initial conditions. Coupling between particles is based on statistical feedback, which means that each particle is affected by the average behaviour of its neighbours. It is shown that the global system may unveil several types of collective behaviours, corresponding to partial synchronisation, characterised by the existence of several clusters of synchronised subsystems, and global synchronisation between particles, where all the elemental particles synchronise completely.

Two protocols without periodicity for the global and preemptive scheduling problem of multi-mode real-time systems upon multiprocessor Platforms

We consider the problem of scheduling a multi-mode real-time system upon identical multiprocessor platforms. Since it is a multi-mode system, the system can change from one mode to another such that the current task set is replaced with a new task set. Ensuring that deadlines are met requires not only that a schedulability test is performed on tasks in each mode but also that (i) a protocol for transitioning from one mode to another is specified and (ii) a schedulability test for each transition is performed. We propose two protocols which ensure that all the expected requirements are met during every transition between every pair of operating modes of the system. Moreover, we prove the correctness of our proposed algorithms by extending the theory about the makespan determination problem.